Submission #1147107

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147107		sushanth123	Knapsack (NOI18_knapsack)	C++20	17 / 100	2 ms	1864 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

int main() {
    long long s, n;
    cin >> s >> n;
    
    vector<tuple<long long, long long, long long>> in(n);
    
    for (int i = 0; i < n; i++) {
        long long v, w, z;
        cin >> v >> w >> z;
        in[i] = {v, w, z};
    }
    
    vector<vector<long long>> dp(s + 1, vector<long long>(n + 1, 0));

    for (int j = 1; j <= n; j++) {
        auto [v, w, z] = in[j - 1];
        for (int i = 0; i <= s; i++) {
            if (w <= i) {
                dp[i][j] = max(dp[i][j - 1], dp[i - w][j - 1] + v);
            } else {
                dp[i][j] = dp[i][j - 1];
            }
        }
    }

    cout << dp[s][n] << endl;
}

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