Submission #1287741

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287741		bilgun	Knapsack (NOI18_knapsack)	C++20	0 / 100	1 ms	568 KiB

knapsack

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

int n, s; 

void subo(vector<int>& v, vector<int>& w, vector<int>& k){
    int ans = 0, count = 0;
    for( int i = 0; i < k[0]; i++){
        if( count + w[0] > s){
            cout << ans;
            return;
        }
        count += w[0];
        ans += v[0];
    }
}

int main()
{
    cin >> n >> s;
    vector<int> v(n), w(n), k(n);
    for( int i = 0; i < n; i++){
        cin >> v[i] >> w[i] >> k[i];
    }
    if( n == 1){
        subo(v, w, k);
        return 0;
    }

    return 0;
}

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