1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
|
#include <iostream> #include <algorithm> using namespace std; typedef long long ll;
struct Item { int v, w; } item[400005];
int n, W, tot; ll f[400005];
int main() { cin >> n >> W; for (int i = 1; i <= n; i++) { int v, w, m; cin >> v >> w >> m; int c = 1; while (m - c > 0) { m -= c; item[++tot].v = c * v; item[tot].w = c * w; c *= 2; }
item[++tot].v = m * v; item[tot].w = m * w; }
n = tot;
for (int i = 1; i <= n; i++) { for (int j = W; j >= 0; j--) { if (j >= item[i].w) { f[j] = max(f[j], f[j-item[i].w] + item[i].v); } } }
cout << f[W] << endl; return 0; }
|