제출 #592820

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
592820		mjay	Knapsack (NOI18_knapsack)	C++11	37 / 100	123 ms	262144 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

int main(){
    int S, N;
    cin >> S >> N;

    vector<int> values, weights;
    for(int i=0; i<N; i++){
        int value, weight, freq;
        cin >> value >> weight >> freq;
        while(freq--){
            values.push_back(value);
            weights.push_back(weight);
        }
    }

    N = weights.size();
    vector<vector<int>> dp(N+1, vector<int>(S+1, 0));
    
    for(int i=1; i<=N; i++){
        for(int j=0; j<=S; j++){
            dp[i][j] = dp[i-1][j];
            int left = j - weights[i-1];
            if(left >= 0)
                dp[i][j] = max(dp[i][j], dp[i-1][left] + values[i-1]);
        }
    }

    cout << dp[N][S] << endl;
}

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