Submission #1140170

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140170		hemaprakash	Knapsack (NOI18_knapsack)	C++20	73 / 100	1093 ms	420 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

int main() {
    int s, n;
    cin >> s >> n;

    vector<int> dp(s + 1);
    dp[0] = 0;
    for (int i = 0; i < n; i++) {
        int v, w, k;
        cin >> v >> w >> k;
        for (int j = s; j >= w; j--) {
            for (int cnt = 1; cnt <= k && cnt * w <= j; cnt++) {
                dp[j] = max(dp[j], dp[j - cnt * w] + cnt * v);
            }
        }
    }

    cout << dp[s] << "\n";

    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 0 / 27