제출 #1257882

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1257882		beka19	Knapsack (NOI18_knapsack)	C++20	100 / 100	43 ms	2884 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define sped ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define s second
#define f first
#define int long long
void okok(){
    int n,s;
    cin >> s >> n;
    vector < int > dp(s + 1,-1e18);
     vector< pair<int,int> > g[2010];
     for(int i = 1;i <= n;i++){
        int v,w,k;
        cin >> v >> w >> k;
        g[w].pb({v,k});
     }
     for(int i = 1;i <= s;i++){
    sort(g[i].begin(),g[i].end());
     }
     dp[0] = 0;
     for(int i = 1;i <= s;i++){
            int c = 0;
      for(int k = 1;k <= s / i;k++){
       if(g[i].size() == 0) {break;}
        c++;
        for(int j = s;j >= i;j--){
            if(dp[j - i] == -1e18) continue;
            dp[j] = max(dp[j],dp[j - i] + g[i][g[i].size() - 1].f);
        }

        g[i][g[i].size() - 1].s--;

        if(g[i][g[i].size()-1].s == 0) g[i].pop_back();
      }
     }
     int mx = 0;
     for(int i = 1;i <=s;i++){
        mx = max(dp[i],mx);
     }
     cout << mx;
}
signed main() {
sped
int tt = 1;
//cin >> tt;
while(tt--){
    okok();
     cout << '\n';
    }
}

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