Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51283 Accepted Submission(s): 17523 Problem Description Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002. Input Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 -- the total number of different facilities). The next N lines contain an integer V (0<V<=50 --value of facility) and an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different. Output For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B. Sample Input 2 10 1 20 1 3 10 1 20 2 30 1 -1 Sample Output 20 10 40 40 Author lcy 直接以sum/2为背包容量进行多重背包dp即可。 |
HDU1171 Big Event in HDU 多重背包
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Tawn0000/article/details/82526144
猜你喜欢
转载自blog.csdn.net/Tawn0000/article/details/82526144
今日推荐
周排行