hdu 1171 Big Event in HDU(多重背包)

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int dp[200000];
int main( )
{
int n,v[51],m[51],i,V,sum,j,k;
while(cin>>n)
{
if(n<0)
break;
sum=0;
for(i=0;i<n;i++)
{
cin>>v[i]>>m[i];
sum+=v[i]*m[i];
}
V=sum/2;
memset(dp,0,sizeof(dp));
for(i=0;i<n;i++)
for(k=1;k<=m[i];k++)
for(j=V;j>=k*v[i];j--)
dp[j]=(dp[j-k*v[i]]+k*v[i])>dp[j]?dp[j-k*v[i]]+k*v[i]:dp[j];
cout<<sum-dp[V]<<" "<<dp[V]<<endl;
}
return 0;
}