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).
InputInput 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.
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).
A test case starting with a negative integer terminates input and this test case is not to be processed.
OutputFor 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 -1Sample Output
20 10 40 40
解题思路
一道多重背包题,但是规定B不得超过A,那么B就不能超过总数向下取整的一半,其重量就是它本身的价值,那也就变成了一道普通的01背包题目,即尽量的装满容量为sum/2的背包,并且用滚动数组去优化不会TLE。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int value[5005];
int dp[125005];
int main(){
int n,v,m;
int index,sum;
while(~scanf("%d",&n) && n > 0){
sum = 0;
index = 0;
memset(dp,0,sizeof(dp));
memset(value,0,sizeof(value));
for(int i = 0;i < n;i++){
scanf("%d %d",&v,&m);
for(int j = m;j > 0;j--){
value[index++] = v;
sum += v;
}
}
for(int i = 0;i < index;i++){
for(int j = sum / 2;j >= value[i];j--){
dp[j] = max(dp[j],dp[j - value[i]] + value[i]);
}
}
printf("%d %d\n",sum - dp[sum / 2],dp[sum / 2]);
}
return 0;
}