#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()
{
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)
if(record[j]>record[j-weight[i]]+value[i])
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;
}
hduj 1114 完全背包
最新推荐文章于 2014-07-28 19:29:14 发布