hdu 1114 多重背包

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1114

#include <stdio.h>
#define max 0x3f3f3f3f//大一点，不然有wa的可能
int dp[10010];
int num[510][2];

int min(int a,int b)
{
	return a<b?a:b;
}

int main()
{
	int test,n;
	int e,f;
	int i,j;

	scanf("%d",&test);

	while(test--)
	{
		scanf("%d %d %d",&e,&f,&n);
		f -= e;
		dp[0] = 0;
		for(i = 1; i <= f; i++)
		{
			dp[i] = max;
		}

		for(i = 1; i <= n; i++)
			scanf("%d %d",&num[i][0],&num[i][1]);

		for(i = 1; i <= n; i++)
		{
			for(j = num[i][1]; j <= f; j++)
			{
				dp[j] = min(dp[j],dp[j-num[i][1]]+num[i][0]);
			}
		}
		if(dp[f] < max)
			printf("The minimum amount of money in the piggy-bank is %d.\n",dp[f]);
		else printf("This is impossible.\n");
	}
	return 0;
}