제출 #1342479

#제출 시각아이디문제언어결과실행 시간메모리
1342479vjudge1Knapsack (NOI18_knapsack)C++20
17 / 100
1 ms344 KiB
#include <bits/stdc++.h>
using namespace std;

int dp[2069];

signed main(){

    cin.tie(0); ios::sync_with_stdio(0);
    int w, n; cin >> w >> n;
    for(int i=1; i<=n; i++){
        int v, a, k; cin >> v >> a >> k;
        for(int j=1; k>0; j<<=1){
            int W = a*j, V = v*j;
            for(int x=w; x-W>=0; x--)
                dp[x] = max(dp[x], dp[x-W]+V);
            k -= j;
        }
    }
    cout << dp[w];

    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...