hdu 1114 完全背包 背包问题通俗讲解

经典问题，在网上看到过很好的讲解

http://www.cnblogs.com/daoluanxiaozi/archive/2012/05/06/2486105.html 

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<math.h>
#include<stack>
using namespace std;
int dp[10001];
int main()
{
	freopen("t.txt","r",stdin);
	int val[505],wei[505];
	int w,w2,t,n,i,j;
	scanf("%d",&t);
	while(t--)
	{
		memset(dp,0x3f,sizeof(dp));//比较方便的赋值最大值的方法
		scanf("%d%d",&w2,&w);
		w = w - w2;
	
		scanf("%d",&n);
		for(i = 0; i < n; i++)
		{
			scanf("%d%d",&val[i],&wei[i]);
		}
		dp[0] = 0;//这个千万不能忘
		for(i = 0; i < n; i++)
		{
			for(j = wei[i]; j <= w; j++)
			{
				dp[j] = min(dp[j] , dp[j - wei[i]] + val[i]);
			}
		}
		if(dp[w] < 1<<29 ) printf("The minimum amount of money in the piggy-bank is %d.\n",dp[w]);//上面赋值的最大值比1<<29大比1<<30小
		else printf("This is impossible.\n");
	}
}