纪念dp黑洞水题开窍
#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
int e,f,t,n,dp[10010],w[510],v[510];
int main()
{
scanf("%d",&t);
while (t--)
{
scanf("%d%d",&e,&f);
f-=e;
scanf("%d",&n);
for (int i=1; i<=n; i++)
{
scanf("%d%d",&v[i],&w[i]);
}
memset(dp,0x3f3f3f3f,sizeof(dp));
dp[0]=0;
for (int i=1; i<=n; i++)
{
for (int j=w[i]; j<=f; j++)
{
if (dp[j-w[i]]==dp[10001]) continue;
dp[j]=min(dp[j],dp[j-w[i]]+v[i]);
}
}
if (dp[f]==dp[10001])
{
printf("This is impossible.\n");
}else
{
printf("The minimum amount of money in the piggy-bank is %d.\n",dp[f]);
}
}
return 0;
}