Submission #1303265

#	Time	Username	Problem	Language	Result	Execution time	Memory
1303265		kill3_cro	Knapsack (NOI18_knapsack)	C++20	37 / 100	1086 ms	584 KiB

knapsack

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int n, s;
    cin >> s >> n;

    vector<int> dp(s+1, -1);
    dp[0] = 0;
    for (int i = 0; i < n; i++) {
        int value, weight, m;
        cin >> value >> weight >> m;

        while (m--) {
            for (int j = s; j >= weight; j--) {
                dp[j] = max(dp[j], dp[j-weight] + value);
            }
        }
    }

    cout << *max_element(dp.begin(), dp.end());
}

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