B - Big Event in HDU

B - Big Event in HDU

Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 1171

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 

关于此题，是给出很多东西，每个东西有自己的价值和数量，要求尽可能的将这堆东西分成·两部分，且差值最小，

这里很好的一个方法就是将总价值变成原来的一半，再尽量选出足够接近一半的东西，就得出了最优解

#include<stdio.h>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int n,b,h;
	int sum,i,p,j;
	
while(scanf("%d",&n)&&n>0)
	{
	int dp[100008]={0};
	int zhi[100005]={0};
   	sum=0;
 for(i=0,j=0;i<n;i++)
  {
  	scanf("%d%d",&h,&b);
			while(b--)
             { 
             	zhi[j++]=h;
             	sum=sum+zhi[j-1];
		    }
		    
  }
  	int num=0;
	for(int i=0;i<j;i++)
	{
		for(int v=sum/2;v>=zhi[i];v--)
		{
			dp[v]=max(dp[v],dp[v-zhi[i]]+zhi[i]);
			if(dp[v]>num)
		{
			num=dp[v];
		}
		}
	}
	printf("%d %d\n",sum-num,num);
}
   return 0;
}