hdu/hdoj 1114 Piggy-Bank

题目大意：用储钱罐存钱，知道目前罐的重量以及空罐的重量，然后给出n种硬币的币值和重量，问现在储钱罐里至少有多少钱

这个题是一个完全背包问题，不过注意的是最小值；

状态转移方程我就不写了

#include <iostream>
using namespace std;
 
int nCases;
int nPack, nVolume1, nVolume2, nVolume;
int weight[510], value[510];
int record[10000];
const int INF = 1000000001;
int main()
{    
    //freopen("input.txt", "r", stdin);
 
    scanf("%d", &nCases);
    while(nCases--)
    {
        scanf("%d %d", &nVolume1, &nVolume2);
        nVolume = nVolume2-nVolume1;
        scanf("%d", &nPack);
        for(int i=0; i<nPack; ++i)
        {
            scanf("%d %d", &value[i], &weight[i]);
        }
        for(int i=0; i<=nVolume; ++i)
            record[i] = INF;
        record[0] = 0;
        for(int i=0; i<nPack; ++i)
            for(int j=weight[i]; j<=nVolume; ++j)
                record[j] = min(record[j],record[j-weight[i]]+value[i]);
        if(record[nVolume] == INF)
            printf("This is impossible.\n");
        else
            printf("The minimum amount of money in the piggy-bank is %d.\n",record[nVolume]);
 
    }
    return 0;
}