Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29437 Accepted Submission(s): 10339
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 10 40 40 就是把价值分成两份,让两份之差最小,所以把价值和求出来, 然后找出在一半总价值内能达到的价值,就是一个01背包问题了 ac代码:#include<stdio.h> #include<string.h> #include<math.h> #include<iostream> #include<algorithm> #define MAXN 44444 #define INF 0xfffffff #define max(a,b) a>b?a:b #define min(a,b) a>b?b?a using namespace std; int dp[MAXN]; int v[MAXN]; int main() { int n; int sum; int i,j,k,m; int a,num; while(scanf("%d",&n)!=EOF) { if(n<0) break; sum=0; int ans=0; for(i=0;i<n;i++) { scanf("%d%d",&a,&num); sum+=a*num; while(num--)//把他们都分开,然后就是一个01背包问题 v[ans++]=a; } m=sum/2; memset(dp,0,sizeof(dp)); for(i=0;i<ans;i++) { for(j=m;j>=v[i];j--) { dp[j]=max(dp[j],dp[j-v[i]]+v[i]); } } printf("%d %d\n",sum-dp[m],dp[m]); } return 0; }