제출 #1300690

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1300690		paskalisapo	Knapsack (NOI18_knapsack)	C++20	0 / 100	1 ms	572 KiB

knapsack

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

int main() {
    int s , n;
    cin >> s >> n;

    vector<vector<pair<int,int>>> weight_to_info(s + 1);
    for(int i = 0;i < n; i++){
        int v , w , k;
        cin >> v >> w >> k;

        weight_to_info[w].push_back({v , k});
    }

    vector<pair<int,int>> cantake;
    for(int i = 1;i <= s; i++){
        sort(weight_to_info[i].rbegin(), weight_to_info[i].rend());
        int cur = 0;
        for(auto &x : weight_to_info[i]){
            while(cur < s && x.second > 0){
                cur+= x.first;
                cantake.push_back({x.first, i});
                x.second--;
            }
        }
    }

    //knapsack:
    vector<vector<int>> dp(cantake.size() + 1 , vector<int> (s + 1, 0));
    dp[0][0] = 0;
    for(int i = 1;i <= cantake.size() ;i++) {
        for(int j = 0;j <= s; j++) {
            dp[i][j] = dp[i - 1][j];
            int w = cantake[i - 1].second;
            int cost = cantake[i - 1].first;
            if( j - w >= 0){
                dp[i][j] =max(dp[i][j] , dp[i - 1][j - w] + cost);
            }
        }
    }

    cout << dp[cantake.size()][s] << endl;

}

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