背包探索之完全背包

01背包优化为一维数组十分灵活。

#include<stdio.h>
#define NUM 999999	
int f[99005];
int value[2005];
int weight[2005];
int min(int a,int b)
{
	if(a<b)
		return a;
	else 
		return b;
}
int main()
{		

	int T,E,F;
	int i,j,v,n;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&E,&F);
		v=F-E;
		f[0]=0;
		for(i=1;i<=1001;i++)
			f[i]=NUM;
		scanf("%d",&n);
		for(i=1;i<=n;i++)
			scanf("%d%d",&value[i],&weight[i]);
		for(i=1;i<=n;i++)
			for(j=weight[i];j<=v;j++)
				f[j]=min(f[j],f[j-weight[i]]+value[i]);
		if(f[v]==NUM)
				printf("This is impossible.\n");
		else
			printf("The minimum amount of money in the piggy-bank is %d.\n",f[v]);
	}
	return 0;
}