#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
using namespace std;
const int INF = 1000000000;
int dp[1000000], v[100000], w[100000];
int main()
{
//freopen("ztest.txt","r",stdin);
int t;
scanf("%d", &t);
while(t--)
{
int sum, e, dd;
scanf("%d%d", &e, &dd);
sum = dd - e;
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%d%d", &v[i], &w[i]);
for(int i = 0; i <= sum; i++)
dp[i] = INF;
dp[0] = 0;
for(int j = 0; j < n; j++)
for(int i = 0; i <= sum; i++)
{
if(i >= w[j])
{
dp[i] = min(dp[i], dp[i - w[j]] + v[j]);
//printf("%d ",dp[i]);
}
}
//for(int i = 0; i < sum; i++)
// printf("%d ",dp[sum]);
//printf("\n");
if(dp[sum] < INF)
printf("The minimum amount of money in the piggy-bank is %d.\n",dp[sum]);
else
printf("This is impossible.\n");
}
return 0;
}
hdu 1114 完全背包 动态规划
最新推荐文章于 2021-11-05 23:29:25 发布