ZOJ 2014 Piggy-Bank(完全背包)

这题是求的最小的

转移方程:f[i][v]=min{f[i-1][v-k*c[i]]+k*w[i]|0<=k*c[i]<=v} 

#include <iostream>
#include <cstdio>
#include <memory.h>
using namespace std;
const int maxn=10010;
int dp[maxn],w[510],v[510],E,F,N;
int main(){
	int t;
	scanf("%d",&t);
	while (t--){
		scanf("%d%d%d",&E,&F,&N);
		for (int i=0;i<N;++i){
			scanf("%d%d",&v[i],&w[i]);
		}
		
		memset(dp,0X20,sizeof(dp));
		dp[0]=0;
		for (int i=0;i<N;++i){
			for (int j=w[i];j<=F-E;++j){
				if(dp[j-w[i]]+v[i]<dp[j]){
					dp[j]=dp[j-w[i]]+v[i];
				}
			}
		}
		if(dp[F-E]!=0X20202020){
			printf("The minimum amount of money in the piggy-bank is %d.\n",dp[F-E]);
		}else{
			printf("This is impossible.\n");
		}
	}
	return 0;
}