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. The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).
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. A test case starting with a negative integer terminates input and this test case is not to be processed.
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 |
题意：
样例：
2
10 1
20 1
意思是两种物品，质量为10的物品有一个，质量为20的物品有一个，求如何分使得最大程度的两等分？
答案当然是 ： 20 10 （题目规定大的放前面）
3
10 1
20 2
30 1
意思是三种物品，质量为10的物品有一个，质量为20的物品有两个，，质量为30的物品有一个，求如何分使得最大程度的两等分？
答案当然是 ： 40 40 即20 20放一起 、10 30 放一起即可
分析：本题我采用多重背包转01背包的做法，把输入的物品质量放入a数组，如果物品数量大于1，就放多次，当然可以二进制优化，但在本题中不优化也可以AC。
另外注意判断输入结束必须是t<0 ，而不是t==-1！！！
另外注意判断输入结束必须是t<0 ，而不是t==-1！！！
另外注意判断输入结束必须是t<0 ，而不是t==-1！！！
当然下面就是01背包的模板
1. for i=1..N 2. for v=V..0 3. f[v]=max{f[v],f[v-c[i]]+w[i]};
在本题中，第一层遍历物品的个数N，第二层遍历背包容量sum/2，状态转移方程一套就可以了。
注意dp数组的初始化，还有输出大的放前面即可。
1. #include<iostream> 2. #include<algorithm> 3. #include<cstring> 4. using namespace std; 5. int a[5002]; 6. int dp[500002]; 7. int maxx(int x, int y) { 8. return x > y ? x : y; 9. } 10. int main() 11. { 12. int t; 13. while (~scanf_s("%d", &t) && t >= 0) { 14. int len = 0; 15. int sum = 0; 16. while (t--) { 17. int x, y; 18. scanf_s("%d%d", &x, &y); 19. sum += x * y; 20. while (y--) { 21. a[len++] = x; 22. } 23. } 24. int summ = sum; 25. sum /= 2; 26. memset(dp, 0, sizeof(dp)); 27. for (int i = 0; i < len; i++) { 28. for (int j = sum; j >= a[i]; j--) { 29. dp[j] = maxx(dp[j], dp[j - a[i]] + a[i]); 30. } 31. } 32. printf("%d %d\n", summ - dp[sum], dp[sum]); 33. } 34. return 0; 35. }
