Gemini's Trial 第F题

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
问题链接：https://vjudge.net/contest/279613#problem/F
问题简述：首先输入物品的种类；然后紧接着输入物品的价值和数量；
要求把所有物品分为总价值相差最小的两份；
先输出大价值的一份，再输出另一份。
问题分析：运用01背包算法，把总价值的一半看为背包容量；求能装下的最大价值。
程序说明：（1）先创立三个数组，一个储存价值，一个储存数量，最后一个动态储存；
（2）01背包算法。

#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
 long int max(long int a, long int b)
{
	if (a > b)return a;
	else return b;
}
int main()
{
	long int sum, a, b, c;
	long int v[200000];
	long int w[200000] ;
	long int dp[200000];
	while (cin >> a&&a>0)
	{
		memset(v, 0, sizeof(v));
		memset(w, 0, sizeof(w));
		memset(dp, 0, sizeof(dp));

			sum = 0;
			for (long int i = 0; i < a; i++)
			{
				cin >> v[i];
				cin>> w[i];
				sum = sum + (v[i] * w[i]);
			}
			for (long int i = 0; i < a; i++)
			{
				for (long int k = 0; k < w[i]; k++)
				{
					for (long int j = (sum/2); j >= v[i]; j--)
					{
						dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
					}
				}
			}
			cout << sum - dp[sum/2] << " " << dp[sum/2] << endl;
		}
}