hdu1114

添加链接描述

#include<bits/stdc++.h>
using namespace std;
int dp[10005];
int main()
{
	int t,e,f;
	int n;
	int p[501],w[501];
	int we;
	scanf("%d",&t);
	while(t--){
		cin>>e>>f;
		we=f-e;
		cin>>n;
		for(int i=0;i<n;i++){
			scanf("%d%d",&p[i],&w[i]);
		}
		for(int i=0;i<=we;i++){
			dp[i]=99999999;//求最小，存大数
		}
		dp[0]=0;
		for(int i=0;i<n;i++){
			for(int j=w[i];j<=we;j++){
				dp[j]=min(dp[j],dp[j-w[i]]+p[i]);
			}
		}
		if(dp[we]==99999999) printf("This is impossible.\n");
		else printf("The minimum amount of money in the piggy-bank is %d.\n",dp[we]);
	}
	return 0;
}