hdu 1171 Big Event in HDU(多重背包转化为01背包)

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

int dp[150010];

int main()
{
	int n,val,num,sumval,a[5010],cnt;
	while(~scanf("%d",&n))
	{
		if(n < 0) break;
		sumval = 0;
		cnt = 0;
		for(int i = 1; i <= n; i++)
		{
			scanf("%d %d",&val,&num);
			sumval += val*num;
			while(num--)
				a[++cnt] = val;
		}

		memset(dp,0,sizeof(dp));
		dp[0] = 1;

		int ans = 0;
		for(int i = 1; i <= cnt; i++)
		{
			for(int v = sumval/2; v >= a[i]; v--)	//以总价值一半来背
			{
				if( dp[v-a[i]] == 1)
				{
					dp[v] = 1;
					ans = max(ans,v);
				}
			}
		}
		printf("%d %d\n",sumval-ans,ans);

	}
	return 0;
}