Submission #1306075

#	Time	Username	Problem	Language	Result	Execution time	Memory
1306075		marctg	Knapsack (NOI18_knapsack)	C++17	0 / 100	1094 ms	408 KiB

knapsack

#include <iostream>

using namespace std;

struct ura{
    int v, w, k;
}v[100001];

int dp[2001];

int main()
{
    int s, n;
    cin >> s >> n;
    for(int i = 1; i <= n; i++){
        cin >> v[i].v >> v[i].w >> v[i].k;
    }
    for(int i = 1; i <= n; i++){
        for(int j = s; j >= 1; j--){
            for(int k = 1; k <= v[i].k; k++){
                if(j + (k * v[i].w) <= s){
                    dp[j + (k * v[i].w)] = max(dp[j + (k * v[i].w)], dp[j] + (k * v[i].v));
                }
            }
        }
    }
    cout << dp[s] << "\n";
    return 0;
}

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