제출 #1332334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1332334		piolk	Knapsack (NOI18_knapsack)	C++20	100 / 100	47 ms	1776 KiB

knapsack

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

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

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

    map<int,vector<pair<int,int>>> mp;

    for (int i=0;i<n;i++){
        int v,w,k;
        cin>>v>>w>>k;
        mp[w].push_back({v,k});
    }

    vector<long long> dp(s+1,-1);
    dp[0]=0;

    for (auto &[w,vec]:mp){
        sort(vec.rbegin(),vec.rend());
        long long sum=0;
        for (auto [v,k]:vec){
            for (int i=0;i<k;i++){
                for (int j=s;j>=w;j--){
                    if (dp[j-w]==-1) continue;
                    dp[j]=max(dp[j],dp[j-w]+v);
                }
                sum+=w;
                if (sum>s) break;
            }
            if (sum>s) break;
        }
    }

    long long ans=0;
    for (int i=0;i<=s;i++) ans=max(ans,dp[i]);

    cout<<ans<<"\n";

    return 0;
}

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