hdu1114完全背包恰好装满（dp[v]即所求）无数次使用（前往后）

#include <bits/stdc++.h> //恰满足的 最小 
using namespace std;
const int maxn=1e4+5;
const int inf=0x3f3f3f3f;
int T,n,V,v[maxn],w[maxn],dp[maxn];
int main(){
	int e,f,i,j;
	cin>>T;
	while(T--){
		scanf("%d%d",&e,&f);
		V=f-e;
		scanf("%d",&n);
		memset(dp,inf,sizeof(dp));//完全背包  初始化为  +-无穷 或 -1
		dp[0]=0;//0永远初始为0
		for(i=1;i<=n;i++){
			scanf("%d%d",&v[i],&w[i]);
		}
		for(i=1;i<=n;i++){
			for(j=w[i];j<=V;j++){
				dp[j]=min(dp[j],dp[j-w[i]]+v[i]);
			}
		}
		if(dp[V]!=inf)//完全背包dp[V]就是所求
			printf("The minimum amount of money in the piggy-bank is %d.\n",dp[V]);
		else
			cout<<"This is impossible."<<endl;
	}
}