Submission #1083946

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083946		JohnnyVenturas	Knapsack (NOI18_knapsack)	C++17	73 / 100	1036 ms	2908 KiB

knapsack

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

struct item {
    int weight, price, count;
};

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

    vector<item> items(n);

    for (int i = 0; i < n; ++i) {
        cin >> items[i].price >> items[i].weight >> items[i].count;
    }

    vector<int> dp(s + 1, 0);
    for (int i = 0; i < n; ++i) {
        for (int x = s; x >= 0; --x) {
            for (int count = 1; count <= items[i].count; ++count) {
                if (count * items[i].weight > x)
                    break;
                dp[x] = max(dp[x], dp[x - count * items[i].weight] +
                                       items[i].price * count);
            }
        }
    }

    cout << dp[s] << "\n";
}

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