제출 #1334147

#제출 시각아이디문제언어결과실행 시간메모리
1334147veyis_112Knapsack (NOI18_knapsack)C++20
73 / 100
1094 ms3424 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
ll pul[2001], ceki[2001];
int main(){
    ll n,s1;
    cin>>s1>>n;
    vector<array<ll,3>> v;
    for(ll i=0;i<n;i++){
        ll v1,w,k;
        cin>>v1>>w>>k;
        v.push_back({v1,w,k});
    }
    for(ll i=0;i<n;i++){
        for(ll j=s1;j>=0;j--){
            for(ll t=1;t<=v[i][2];t++){
                if(j>=t*v[i][1]){
                    pul[j]=max(pul[j],pul[j-t*v[i][1]]+t*v[i][0]);
                }
                else break;
            }
        }
    }
    cout<<pul[s1];
}
#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...