HDU 1171 —— Big Event in HDU 01背包入门

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 250000+5;

int dp[maxn];
int a[maxn];
int n;

int main()
{
while(~scanf("%d", &n))
{
if(n < 0)	break;
memset(dp, 0, sizeof dp);
int cnt = 0;
int sum = 0;
for(int i = 1;i<=n;i++)
{
int x, y;
scanf("%d%d", &x, &y);
sum += (x*y);
while(y--)
{
a[++cnt] = x;
}
}
for(int i = 1;i<=cnt;i++)
{
for(int j = sum/2;j>=a[i];j--)
{
dp[j] = max(dp[j], dp[j-a[i]]+a[i]);
}
}
printf("%d %d\n", max(sum-dp[sum/2], dp[sum/2]), min(sum-dp[sum/2], dp[sum/2]));
}
return 0;
}