完全背包
解题思路:
- 这是一个完全背包的问题,多组数据;
- 给定存钱罐的初始重量和最终重量,给定n种货币的价值,重量;
- 求恰好满足存钱罐的最终重量的货币总钱数最小值。
- 若不满足,按题目要求输出“XXX”。
参考:https://blog.csdn.net/weixin_43823808/article/details/104144412
//完全背包
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100001;
const int INF = 0x3f3f3f3f;
int dp[N], w[N], v[N];
int t, x, y, n, sum;
int main() {
int i, j;
cin >> t;
while (t--) {
cin >> x >> y;
sum = y - x;//存钱罐净容量
cin >> n;
for ( i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (i = 1; i <= sum; i++)//初始化为无穷
dp[i] = INF;
for (i = 1; i <= n; i++){//转移方程
for (j = v[i]; j <= sum; j++)
dp[j] = min(dp[j], dp[j - v[i]] + w[i]);
}
if(dp[sum]!=INF)
printf("The minimum amount of money in the piggy-bank is %d.
", dp[sum]);
else
printf("This is impossible.
");
}
return 0;
}