# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023617 | vjudge1 | Knapsack (NOI18_knapsack) | C11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, S;
cin >> N >> S;
vector<int> dp(S + 1, 0);
for (int i = 0; i < N; ++i) {
int V, W, K;
cin >> V >> W >> K;
for (int j = 1; K > 0; j <<= 1) {
int count = min(j, K);
K -= count;
int weight = W * count;
int value = V * count;
for (int w = S; w >= weight; --w) {
dp[w] = max(dp[w], dp[w - weight] + value);
}
}
}
cout << dp[S] << endl;
return 0;
}