hdu1171：Big Event in HDU（多重背包）

http://acm.hdu.edu.cn/showproblem.php?pid=1171

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

题意分析：

给出N个物品的价值和个数，把它们分成差距最小的两份。

解题思路：

多重背包，注意以负数结束而不是以-1结束。

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define N 10020
int a[N], dp[N*13]; 
int main()
{
	int i, m, n, t, j, sum, sum1, u, v;
	while(scanf("%d", &n), n>=0)
	{
		memset(dp, 0, sizeof(dp));
		t=1;sum=0;
		for(i=0; i<n; i++)
		{
			scanf("%d%d", &u, &v);
			sum+=u*v;
			for(j=1; j<=v; j*=2)
			{
				a[t++]=j*u;
				v-=j;
			} 
			if(v)
				a[t++]=v*u;
		}
		sum1=sum/2;
		for(i=1; i<t; i++)
			for(j=sum1; j>=a[i]; j--)
				dp[j]=max(dp[j], dp[j-a[i]]+a[i]);
		printf("%d %d
", max(dp[sum1], sum-dp[sum1]), min(dp[sum1], sum-dp[sum1]));
	}
	return 0;
}