Big Event in HDU

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 4
  
  
  
  

   
   题意：要求要尽量平均分配，所以我们可以先将总价值sum求出，然后得出其分配的平均值为sum/2,要注意这个答案可能为小数，但是又因为sum是整数，所以最后得出的sum/2是要小于等于实际的值。将这个结果进行01,背包，可以得出其中一个学院所得的最大价值，而另一个学院的最大价值也可以相应的得到，而前者必定小于等于后者。
  
  
  
  

   
   
#include<cstdio>
#include<cstring>
#include<algorithm>
#define size 500009
using namespace std;
int a[size],b[size];
int main()
{
	int n,i,m,j,k,h;
	while(~scanf("%d",&n))
	{
		int sum=0,l,p=0;
		if(n<=0) break;
		memset(b,0,sizeof(b));
		for(i=0;i<n;i++)
		{
		scanf("%d%d",&h,&k);
		while(k--)
		{
			a[p++]=h;
			sum+=h;
		}
		}
		l=sum/2;
		for(i=0;i<p;i++)
		{
			for(j=l;j>=a[i];j--)
			b[j]=max(b[j],b[j-a[i]]+a[i]);
		}
		printf("%d %d\n",sum-b[l],b[l]);
	}
	return 0;
}