题目大意:急!灾区的食物依然短缺!
为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。
请问:你用有限的资金最多能采购多少公斤粮食呢?
解题思路:多重背包模版题
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 110;
int n, m;
int num[N], price[N], weight[N], used[N], dp[N];
void init() {
scanf("%d%d", &m, &n);
for (int i = 0; i < n; i++)
scanf("%d%d%d", &price[i], &weight[i], &num[i]);
}
void solve() {
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) {
for (int j = 1; j <= num[i]; j++)
for (int k = m; k >= price[i]; k--) {
dp[k] = max(dp[k], dp[k - price[i]] + weight[i]);
}
}
int ans = 0;
for (int i = 0; i <= m; i++)
ans = max(ans, dp[i]);
printf("%d\n", ans);
}
int main() {
int test;
scanf("%d", &test);
while (test--) {
init();
solve();
}
return 0;
}