题目大意:存钱罐的空重为e,现称重为f,已知有n种硬币,每种硬币的价值为vi,重量为wi,问这些硬币的重量符合称重的重量吗,符合的话求存钱罐里装的钱最少价值多少
1<=e<=f<=1e4;1<=n<=500;1<=vi<=5e4,1<=wi<=1e4
思路:完全背包在01背包(Bone Collector hdu2602_timidcatt的博客-CSDN博客)的基础上一种物品可以取多个,所以拿第i中物品的状态转移方程为dp[i][j]=dp[i][j-w[i]+v[i],所以与01背包唯一的不同就是变为了从i到i转移,那么我们将其优化为一维数组后,直接正向更新,也就模拟了之前的i向之后的i转移的过程
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 1e4 + 5, INF = 1e9+1;
int dp[N], v[N], w[N];
int main()
{
int t;
cin >> t;
while (t--)
{
int e, f;
scanf("%d%d", &e, &f);
int W = f - e;//背包的总重
int n;
scanf_s("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%d%d", &v[i], &w[i]);
}
for (int i = 1; i <= W; i++)
{
dp[i] = INF;//注意初始化的大小,dp[j]+v[i]后不能爆int
}
dp[0] = 0;将dp[j]初始化为0
for (int i = 1; i <= n; i++)
{
for (int j = w[i]; j <= W; j++)
{
dp[j] = min(dp[j], dp[j - w[i]] + v[i]);//求背包最小价值
}
}
if (dp[W] == INF)
{//如果dp[w]没有被更新,说明凑不出这个重量
printf("This is impossible.\n");
continue;
}
printf("The minimum amount of money in the piggy-bank is %d.\n", dp[W]);
}
return 0;
}