제출 #1192525

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192525		dprto	Knapsack (NOI18_knapsack)	C++20	17 / 100	0 ms	328 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define x first
#define y second
#define MASK(i) (1 << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define f(i, l, r) for(int i = l; i <= r; ++i)
const int mod = 1e9 + 7;
const int ars = 1e5 + 5;
const ll infll = 1e18;


int s, n, v[ars], w[ars], k[ars], dp[ars];
signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> s >> n;
    for(int i = 1; i <= n; ++i) cin >> v[i] >> w[i] >> k[i];

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


    return 0;
}

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