Submission #1272675

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272675		vaibhav	Knapsack (NOI18_knapsack)	C++20	100 / 100	90 ms	1816 KiB

knapsack

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


int main() {
    int s, n, val, w, k;
    cin >> s >> n;

    vector<vector<pair<int, int>>> v(s+1);
    for (int i = 0; i < n; i++) {
        cin >> val >> w >> k;
        v[w].emplace_back(val, k);
    }

    vector<pair<int, int>> items;

    priority_queue<int, vector<int>, greater<>> pq;
    for (int i = 1; i <= s; i++) {
        int mx = s/i;

        for (auto &p : v[i]) {
            while (p.second--) {
                if (pq.size() < mx) pq.push(p.first);
                else if (pq.top() < p.first) {
                    pq.pop();
                    pq.push(p.first);
                } else break;
            }
        }

        while (!pq.empty()) {
            items.emplace_back(i,  pq.top());
            pq.pop();
        }
    }

    vector<int> dp(s+1, INT_MIN);
    dp[0] = 0;
    for (auto const &item : items) {
        for (int i = s; i >= item.first; i--) {
            dp[i] = max(dp[i], dp[i - item.first] + item.second);
        }
    }

    int mx = 0;
    for (auto const &i : dp) mx = max(mx, i);
    cout << mx << endl;
    return 0;
}

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