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.<br>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).<br>
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.<br>A test case starting with a negative integer terminates input and this test case is not to be processed.<br>
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.<br>
Sample Input
2
10 1
20 1
3
10 1
20 2
30 1
-1
Sample Output
20 10
40 40
题意:
杭大要分东西,尽量让两者的价值相同,但是要A>=B,
每个物品的个数不一定
思路:
多重背包求最大值的模板
状态转移方程:
dp[j]=max(dp[j],dp[j-s[i].v]+s[i].v);
code:
#include<iostream>
#include<cstring>
struct bag
{
int v;
int w;
}s[105];
int dp[250005];
using namespace std;
int main()
{
int n;
int a,b;//两个小组
int sum;//总和
int av;//平均
while(cin>>n&&n>0)
{
sum=a=b=av=0;
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;++i)
{
cin>>s[i].v>>s[i].w;
sum+=(s[i].v*s[i].w);
}
av=sum/2;//先计算最基本的平分
for(int i=1;i<=n;++i)
{
for(int k=0;k<s[i].w;++k)//个数
for(int j=av;j>=s[i].v;--j)
dp[j]=max(dp[j],dp[j-s[i].v]+s[i].v);
}
a=max(dp[av],sum-dp[av]);//a>=b
b=sum-a;
cout<<a<<" "<<b<<endl;
}
return 0;
}