zoukankan      html  css  js  c++  java
  • SZU:B36 Reading books

    Description

    In the summer vacation, LRJ wants to improve himself in computer science. So he finds out N books of computer science in the school library. The books are numbered from 0 to N-1.

    To finish reading the i-th book, it takes LRJ time[i] minutes. But some books are similar in the content. If the i-th book and the j-th book are similar, then if LRJ has finished reading the i-th book, it will take him only \left \lfloor \frac{time[j]}{2} \right \rfloor minutes to finish reading the j-th book. Of course if LRJ has finished reading the j-th book, it will take him only \left \lfloor \frac{time[i]}{2} \right \rfloor minutes to finish reading the i-th book. Now you are asked to tell LRJ the minimal total time to finish reading all the N books.

    Input

    The first line contains two integers N(0\leq N \leq 100) and M(0\leq M \leq N\times (N-1)/2). N is the total number of books. M is the number of pairs which are similar.

    Then the following N lines describe time[0],time[1],\cdots,time[n-1](1\leq time[i] \leq 10^{5}).

    Next comes M lines, each contains two integer (i,j), indicating that the i-th book and the j-th book are similar.

    Input is ended with EOF.

    Output

    For each test case, just output the minimal total time on a single line.

    Sample Input

    2 1
    6
    10
    0 1
    3 2
    1
    2
    3
    0 1
    1 2
    3 1
    2
    4
    6
    0 1
    

    Sample Output

    11
    3
    10
    

     Hint:For the first test case, if LRJ read the books in the order (0, 1), then the total time = 6+10/2=11; If in the order (1, 0), then the total time =10+ 6/2=13.

  • 相关阅读:
    struts2自定义拦截器之过滤不良言论---http500可能的问题所在
    bzoj4205[FJ2015集训] 卡牌配对
    bzoj1562[NOI2009] 变换序列
    bzoj1433[ZJOI2009] 假期的宿舍
    bzoj2150 部落战争
    从bzoj2463到bzoj1443和bzoj2437 博弈+二分图匹配
    bzoj4554[Tjoi2016&Heoi2016] 游戏
    bzoj1059[ZJOI2007] 矩阵游戏
    bzoj1143[CTSC2008] 祭祀river
    bzoj3175[Tjoi2013] 攻击装置
  • 原文地址:https://www.cnblogs.com/firstrate/p/3080649.html
Copyright © 2011-2022 走看看