#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, cnt = 0;
int v[maxn], w[maxn];
int f[maxn];
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
int a, b, s;
cin >> a >> b >> s;
int k = 1;
while (k <= s)
{
v[++cnt] = k * a;
w[cnt] = k * b;
s -= k;
k *= 2;
}
while (s > 0)
{
v[++cnt] = a * s;
w[cnt] = b * s;
}
}
n = cnt;
for (int i = 1; i <= n; i++)
for (int j = m; j >= v[i]; j--)
f[j] = max(f[j], f[j - v[i]] + w[i]);
cout << f[m] << endl;
return 0;
}
什么bug,我这边运行输出为0,没有报错
这段代码要实现什么,你的输入是什么,预期输出是什么,实际输出又是什么,请说清楚