HDU 1171 Big Event in HDU

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int val[5005];
int dp[255555];
int main()
{
int n;
while(cin>>n&&(n>0))
{
memset(dp,0,sizeof(dp));
memset(val,0,sizeof(val));
int k=0,sum=0;
int v,m;
for(int i=0;i<n;i++)
{
cin>>v>>m;
while(m--)
{
val[k++]=v;
sum+=v;
}
}
for(int i=0;i<k;i++)
{
for(int j=sum/2;j>=val[i];j--)
{
dp[j]=max(dp[j],dp[j-val[i]]+val[i]);
}
}
cout<<sum-dp[sum/2]<<" "<<dp[sum/2]<<endl;
}
return 0;
}