제출 #676415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
676415		ProCallerAJ	Knapsack (NOI18_knapsack)	C++17	17 / 100	1 ms	1108 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, e) for (int i = 0; i < (e); i++)
#define FOR1(i, e) for (int i = 1; i <= (e); i++)
#define ull unsigned long long int
#define pii pair <int, int>
#define value first.first
#define weight first.second
#define quantity second
int n, s;
pair<pii, int> items[100000];
int dp[100001][2001];
int main(){
    cin >> s >> n;
    FOR(i, n){
        cin >> items[i].value >> items[i].weight >> items[i].quantity;
    }
    FOR1(i, n) {
        for (int j = 0; j <= s; j++) {
            dp[i][j] = dp[i - 1][j];
            if (j >= items[i - 1].weight){
                dp[i][j] = max(dp[i][j], dp[i - 1][j - items[i - 1].weight] + items[i - 1].value);
            }
        }
    }
    cout << dp[n][s];
    return 0;
}

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