动态规划入门——Piggy-Bank

#include<stdio.h>
#include<algorithm>
using namespace std;
int w[501];
int c[501];
int dp[10001];
int main(){
int t,a,b,n;
scanf("%d",&t);
while(t--){
scanf("%d%d%d",&a,&b,&n);
int s=b-a;
for(int i=0;i<n;i++)
scanf("%d%d",&w[i],&c[i]);
for(int i=0;i<=s;i++)
dp[i]=9999999;
dp[0]=0;
for(int i=0;i<n;i++)
for(int j=c[i];j<=s;j++)
dp[j]=min(dp[j],dp[j-c[i]]+w[i]);
if(dp[s]==9999999)
printf("This is impossible.\n");
else
printf("The minimum amount of money in the piggy-bank is %d.\n",dp[s]);
}
return 0;
}