Submission #1272788

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272788		soheil17	Knapsack (NOI18_knapsack)	C++20	37 / 100	1095 ms	580 KiB

knapsack

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

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

    int v[n+1], w[n+1], k[n+1];

    for(int i = 1; i <= n; i++)
    {
        cin >> v[i] >> w[i] >> k[i];
    }

    vector<int> dp(s + 1, 0);

    for(int i = 1; i <= n; i++)
    {
        for(int cnt = 1; cnt <= k[i]; cnt++)
        {
            for(int j = s; j >= w[i]; j--)
            {
                dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
            }
        }
    }

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

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