Submission #1277959

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277959		shirokito	Knapsack (NOI18_knapsack)	C++20	73 / 100	1096 ms	588 KiB

knapsack

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

using ll = long long;

const int N = 2000 + 24;

int n, s; multiset<int> W[N];
int dp[N];

void solve() {
    cin >> s >> n;

    for (int i = 1; i <= n; i++) {
        int v, w, k; cin >> v >> w >> k;
        k = min(k, s / w);
        while (k--) {
            W[w].insert(v);
            if ((int) W[w].size() > s / w) {
                W[w].erase(W[w].begin());
            }
        }
    }

    for (int w = 1; w <= s; w++) {
        for (int v: W[w]) {
            for (int i = s; i >= w; i--) {
                dp[i] = max(dp[i], dp[i - w] + v);
            }
        }
    }

    cout << dp[s] << '\n';
}   

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    int T = 1; // cin >> T;
    while (T--) {
        solve();
    }
}

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