Submission #1172371

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172371		dbekarys	Knapsack (NOI18_knapsack)	C++20	0 / 100	33 ms	35648 KiB

knapsack

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

int dp[2000][2000];
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie();

    int m, n;
    cin >> m >> n;

    int a[n + 1], b[n + 1], c;
    vector<int> v1, v2;

    for (int i = 1; i <= n; i++) {
        cin >> b[i] >> a[i] >> c;
        for (int j = 1; j <= c; j++) {
            v1.push_back(a[i]);
            v2.push_back(b[i]);
        }
    }

    for (int i = 1; i <= v1.size(); i++) {
        for (int j = 1; j <= m; j++) {
            dp[i][j] = dp[i - 1][j];
            if (v1[i - 1] <= j) {
                dp[i][j] = max(dp[i][j], dp[i - 1][j - v1[i - 1]] + v2[i - 1]);
            }
        }
    }

    cout << dp[v1.size()][m];
}

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