hdu Big Event in HDU

Big Event in HDU

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 78 Accepted Submission(s): 48

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 这题是一个典型的背包问题，这里的背包最大容积为w[i](1<=i<=n)的一半。而背包所能取的最大物品数为 n[i](1<=i<=n)的一半。 View Code 1 #include <stdio.h> 2 #include <string.h> 3 #include <stdlib.h> 4 #include <iostream> 5 using namespace std; 6 int p[250010],f[250010]; 7 int cmp(const void *a,const void *b) 8 { 9 return *(int *)b - *(int *)a;//a-b 从小到大排序 b-a 从大到小排序 10 } 11 int main() 12 { 13 int N,i,v,m,sum1,sum2,max,tem; 14 while(cin>>N,N>=0) 15 { 16 memset(p,0,sizeof(p)); 17 memset(f,0,sizeof(f)); 18 sum1 = sum2 = max = i = 0; 19 while(N--) 20 { 21 scanf("%d %d",&v,&m); 22 while(m--) 23 { 24 p[i] = v; 25 sum1 +=v; 26 i++; 27 } 28 } 29 sum2 = sum1/2; 30 qsort(p,i,sizeof(p[0]),cmp); 31 // cout<<p[0]<<endl; 32 f[0] = p[0]; 33 if(i!=1) 34 { 35 for(int j = 1 ; j < i ; j++) 36 { 37 f[j] = f[j-1]+p[j]; 38 if(f[j]>sum2) 39 { 40 for(int k = 0 ; k < j; k++) 41 { 42 tem = f[k] + p[j]; 43 if(tem<=sum2&&tem>f[j]) 44 f[j] = tem; 45 else continue; 46 } 47 } 48 if(f[j]>sum2)f[j] = p[j]; 49 if(f[j]>max&&f[j]<=sum2)max = f[j]; 50 // cout<<f[j]<<endl; 51 } 52 } 53 cout<<sum1-max<<" "<<max<<endl; 54 } 55 return 0; 56 }