Submission #879062

#TimeUsernameProblemLanguageResultExecution timeMemory
879062AminMDNZKnapsack (NOI18_knapsack)C++14
37 / 100
1041 ms448 KiB
#include<bits/stdc++.h>
using namespace std;
int n, s;
vector<long long> dp;
vector<int> v;
vector<int> w;
vector<int> k;

int main(){
    cin>>s>>n;
    dp.assign(s+1, 0);
    v.resize(n);
    w.resize(n);
    k.resize(n);
    for(int i=0;i<n;i++) cin>>v[i]>>w[i]>>k[i];

    dp[0] = 0;

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

    cout<<dp[s];
}
#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...