Submission #1364441

#	Time	Username	Problem	Language	Result	Execution time	Memory
1364441		shreyas_arun	Knapsack (NOI18_knapsack)	C++20	0 / 100	0 ms	344 KiB

knapsack

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

using ll = long long;

struct bag
{
    ll v, w, k;
};

void solve()
{
    ll n, s;
    cin >> n >> s;
    vector<bag> store(n);
    for (auto &i : store)
    {
        cin >> i.v >> i.w >> i.k;
    }
    if (n == 1)
    {
        if (s < store[0].w)
        {
            cout << 0 << '\n';
            return;
        }
        ll cal = s / store[0].w;
        if (cal > store[0].k)
        {
            cout << store[0].v * store[0].k << '\n';
        }
        else if (cal <= store[0].k)
        {
            cout << store[0].v * cal << '\n';
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

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