Submission #1192837

#TimeUsernameProblemLanguageResultExecution timeMemory
1192837dprtoKnapsack (NOI18_knapsack)C++20
17 / 100
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 1e5 + 5;


int s, n, v[MAXN], w[MAXN], k[MAXN], dp[MAXN];
signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> s >> n;
    for(int i = 1; i <= n; ++i){
        cin >> v[i] >> w[i] >> k[i];
    }

    for(int i = 1; i <= n; ++i){
        for(int j = s; j >= w[i]; --j){
            dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
        }
    }
    cout << dp[s];


    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...