Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37766 Accepted Submission(s): 13094
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).
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.
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 1040 40
这道题目主要是有那么多东西,怎么分才能使他们的价值差最小; 本质还是01背包,怎么样是最好的情况,那肯定相等,我们只需要dp[sum/2] 的最大值就行了
#include<cstdio> #include<cstring> int v[51000]; int dp[51000]; int get_max(int a,int b) { if(a>b) return a; return b; } int main() { int n; while(~scanf("%d",&n)&&n>0) { memset(dp,0,sizeof(dp)); int m,i=1,temp,sum=0; while(n--) { scanf("%d%d",&v[i],&m); temp=v[i]; sum+=v[i]*m; while(m--) v[i++]=temp; } int sum1=sum; sum/=2; int j,k; for(j=1;j<i;++j) { for(k=sum;k>=v[j];--k) dp[k]=get_max(dp[k],dp[k-v[j]]+v[j]); } printf("%d %d\n",sum1-dp[sum],dp[sum]); } return 0; }