제출 #1082797

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082797		1tejasjain	Knapsack (NOI18_knapsack)	C++17	37 / 100	1054 ms	604 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
//By Tejas India, https://www.linkedin.com/in/1tejasjain/
void call(){
    int s, n;  cin>>s>>n;
    vector<int> maxValueByWeight(s+1, 0);
    maxValueByWeight[0] = 0;
    for(int item=1; item<=n; item++){
        int value, weight, quantity; cin>>value>>weight>>quantity;
        // cout<<"Item: "<<item<<endl;
        for(int i=1; i<=quantity; i++)
            for(int ks = s; ks>=0; ks--){
                    if(ks-weight>=0)
                        maxValueByWeight[ks] = max(maxValueByWeight[ks], maxValueByWeight[ks-weight]+value);
                // cout<<ks<<": "<<maxValueByWeight[ks]<<" ";
            }
        // cout<<endl;
    }
    cout<<maxValueByWeight[s]<<endl;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t=1;
    //cin>>t;
    while(t--){
        call();
    }
    return 0;
}

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