基础dp - 完全背包 F - Piggy-Bank HDU - 1114

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<algorithm>
#include<iostream>
#include<set>
using namespace std;
const int mmax = 600100;
const int inf = 0x3f3f3f3f;
int dp[mmax],data[mmax],da[mmax];
int n;
int p[mmax],w[mmax];
int main()
{
int t;
cin>>t;
while(t--)
{
int s,e;
scanf("%d%d",&s,&e);
cin>>n;
int m = e-s;
for(int i=0;i<n;i++)
scanf("%d%d",&p[i],&w[i]);
memset(dp,inf,sizeof(dp));
dp[0] = 0;  //***重要
for(int i=0;i<n;i++)
{
for(int j=w[i];j<=m;j++)
{
dp[j] = min(dp[j],dp[j-w[i]]+p[i]);
}
}
if(dp[m]==inf)puts("This is impossible.");
else printf("The minimum amount of money in the piggy-bank is %d.\n",dp[m]);
}
return 0;
}