hdu 1114 Piggy-Bank

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
int min(int a,int b)
{
	return a<b?a:b;
}
int main()
{
	int t;
	int i,j;
	scanf("%d",&t);
	while(t--)
	{
		int m,sum;
		scanf("%d %d",&m,&sum);
		sum=sum-m;
		int dp[10010]={0};
		for(i=1;i<=sum;i++)
		{
			dp[i]=9999999; //题目求最小值，故把dp初始化为最大值。 
		}
		int n;
		scanf("%d",&n);
		int w[510];
		int p[510];
		for(i=0;i<n;i++)
		{
			scanf("%d %d",&p[i],&w[i]);
		}
		for(i=0;i<n;i++)
		{
			for(j=w[i];j<=sum;j++)
			{
				dp[j]=min(dp[j],dp[j-w[i]]+p[i]);//完全背包 
			}
		}
		if(dp[sum]!=9999999){
			printf("The minimum amount of money in the piggy-bank is %d.\n",dp[sum]);
		}else{
			printf("This is impossible.\n");
		}
	}
	return 0; 
}