Submission #1130502

#	Time	Username	Problem	Language	Result	Execution time	Memory
1130502		mestive	Knapsack (NOI18_knapsack)	C++20	0 / 100	0 ms	324 KiB

knapsack

#include<bits/stdc++.h>

using namespace std;

int main() {

    ios::sync_with_stdio(0);
    cin.tie(0);

    
    int K{}, M{};
    cin >> K >> M;
    vector<int> w(M+1);
    vector<int> p(M+1);
    w[0] = p[0] = 0;
    for (int i = 1; i <= M; i++) {
        cin >> w[i] >> p[i];
    }
    vector<vector<int>> dp(M+1, vector<int>(K+1, 0));
    for (int i = 1; i <= M; i++) {
        for (int j = 1; j <= K; j++) {
            if (j >= w[i])
                dp[i][j] = max(dp[i-1][j], dp[i-1][j-w[i]] + p[i]);
            else
                dp[i][j] = dp[i-1][j];
        }
    }
    cout << dp[M][K] << "\n";

    return 0;
}

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