제출 #779125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
779125		c2zi6	Knapsack (NOI18_knapsack)	C++14	0 / 100	1 ms	340 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void solve() {
    int n, s;
    cin >> n >> s;
    vector<int> v(n+1), w(n+1), k(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> v[i] >> w[i] >> k[i];
    }
    ll dp[n+1][s+1];
    for (int i = 0; i <= s; i++) dp[0][i] = -1e17;
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= s; j++) {
            dp[i][j] = dp[i-1][j];
            if (j - w[i] >= 0) dp[i][j] = max(dp[i][j], dp[i-1][j - w[i]] + v[i]);
        }
    }
    ll ans = 0;
    for (int i = 0; i <= s; i++) ans = max(ans, dp[n][i]);
    cout << ans << endl;
}

int main() {
    int t = 1;
    //cin >> t;
    while (t--) solve();
    return 0;
}

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