Submission #1067475

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067475		rohanjha	Knapsack (NOI18_knapsack)	C++14	17 / 100	3 ms	348 KiB

knapsack

#include<iostream>
#include<vector>
using namespace std;
int main(){
    int s, n;
    cin>>s>>n;
    vector<vector<int> > items(n);
    for(int i=0; i<n; i++){
        int v, w, k;
        cin>>v>>w>>k;
        items[i]= {v,w,k};
    }
    
    vector<int> dp(s+1, 0);
    for(int i=0; i<n; i++){
        for(int j=items[i][2]; j>0; j--){
            for(int k=s; k>=items[i][1]*j; k--){
                dp[k]=max(dp[k], dp[k-items[i][1]*j]+items[i][0]*j);
            }
        }
    }
    cout<<dp[s]<<endl;
    return 0;
}

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