hdu 1114 Piggy-Bank

http://acm.hdu.edu.cn/showproblem.php?pid=1114

完全背包。

#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 50000
using namespace std;
const int inf=1<<28;

int dp[maxn];
int p[maxn],w[maxn];
int t,n,e,f;

int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&e,&f);
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d",&p[i],&w[i]);
        }
        for(int j=1; j<=f-e; j++)
        {
            dp[j]=inf;
        }
        dp[0]=0;
        for(int i=1; i<=n; i++)
        {
            for(int j=w[i]; j<=f-e; j++)
            {
                dp[j]=min(dp[j],dp[j-w[i]]+p[i]);
            }
        }
        if(dp[f-e]==inf)
            printf("This is impossible.
");
        else
            printf("The minimum amount of money in the piggy-bank is %d.
",dp[f-e]);
    }
    return 0;
}