제출 #1043884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1043884		sanatp977	Knapsack (NOI18_knapsack)	C++17	73 / 100	1096 ms	2036 KiB

knapsack

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

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int s; cin >> s;
    int n; cin >> n;

    vector<tuple<int, int, ll>> stor(n); 
    for (int i = 0; i < n; i++) {
        int a, b;
        ll c;
        cin >> a >> b >> c;
        stor[i] = make_tuple(b, a, min((ll)s / b, c));
    }

    sort(stor.begin(), stor.end()); 

    vector<ll> dp(s + 1, 0);
    ll ans = 0;

    for (int i = 0; i < n; i++) {
        int weight = get<0>(stor[i]);
        int value = get<1>(stor[i]);
        ll maxItems = get<2>(stor[i]);

        for (int j = 0; j < maxItems; j++) {
            for (int x = s; x >= weight; x--) {
                dp[x] = max(dp[x], dp[x - weight] + value);
                ans = max(ans, dp[x]);
            }
        }
    }

    cout << ans << "\n";
}

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