제출 #1254823

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1254823		orny_nabila	Knapsack (NOI18_knapsack)	C++20	73 / 100	360 ms	327680 KiB

knapsack

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

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int S, N;
    cin >> S >> N;

    map<int, vector<int>> weight_groups;

    for (int i = 0; i < N; ++i) {
        int v, w, k;
        cin >> v >> w >> k;

        int limit = min(k, S / w);
        for (int j = 0; j < limit; ++j) {
            weight_groups[w].push_back(v);
        }
    }

    vector<pair<int, int>> final_items;

    for (auto& [w, vals] : weight_groups) {
        int limit = S / w;
        if ((int)vals.size() > limit) {

            nth_element(vals.begin(), vals.begin() + limit, vals.end(), greater<>());
            vals.resize(limit);
        }
        for (int v : vals) {
            final_items.emplace_back(w, v);
        }
    }

    vector<int> dp(S + 1, 0);
    for (auto& [w, v] : final_items) {
        for (int j = S; j >= w; --j) {
            dp[j] = max(dp[j], dp[j - w] + 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