Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22697 Accepted Submission(s): 7969
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.
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[2500005],v[5005];
int main()
{
int n,i,j,sum,a,b;
while(cin>>n,n>=0)
{
sum=0;
int l=0;
memset(v,0,sizeof(v));
for(i=0;i<n;i++)
{
cin>>a>>b;
while(b--)
{
v[l++]=a;
sum=sum+a;
}
}
memset(dp,0,sizeof dp);
for(i=0;i<l;i++)
for(j=sum/2;j>=v[i];j--)
{
dp[j]=max(dp[j],dp[j-v[i]]+v[i]);
}
cout<<sum-dp[sum/2]<<" "<<dp[sum/2]<<endl;
}
return 0;
}