Submission #1272787

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272787		soheil17	Knapsack (NOI18_knapsack)	C++20	12 / 100	1 ms	576 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> a;
    for(int i = 1; i <= n; i++)
    {
        a.push_back(i);
    }

    
    sort(a.begin(), a.end(), [&](int i, int j) {
        return (float)v[i] / w[i] > (float)v[j] / w[j];
    });

    int cost = 0;

    for(int idx = 0; idx < n; idx++)
    {
        int i = a[idx];
        while(s >= w[i] && k[i] > 0)
        {
            cost += v[i];
            s -= w[i];
            k[i]--;
        }
    }

    cout << cost ;
}

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