二进制优化
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 25000;
int n, m;
int v[N], w[N];
int f[N];
int main() {
cin >> n >> m;
int cnt = 0;
for (int i = 1; i <= n; i++) {
int vv, ww, s;
cin >> vv >> ww >> s;
for (int k = 1; k <= s; k *= 2) {
cnt++;
v[cnt] = vv * k;
w[cnt] = ww * k;
s -= k;
}
if (s) {
cnt++;
v[cnt] = vv * s;
w[cnt] = ww * 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;
}