Submission #976644

#	Time	Username	Problem	Language	Result	Execution time	Memory
976644		vjudge1	Knapsack (NOI18_knapsack)	C++17	12 / 100	1 ms	348 KiB

knapsack

#include <iostream>
#include <algorithm>
using namespace std;

struct Kue {
    long long value, weight, stock;
};

int main() {
    int s, n;
    long long ans = 0;
    cin >> s >> n;
    Kue kue[n];
    for (int i = 0; i < n; i++) {
        cin >> kue[i].value >> kue[i].weight >> kue[i].stock;
    }
    
    sort(kue, kue + n, [](const Kue &a, const Kue &b) {
        return a.value * b.weight > b.value * a.weight;
    });

    int k;
    for (int i = 0; i < n; i++) {
        if (kue[i].weight > s) continue;
        k = min(s / kue[i].weight, kue[i].stock);
        ans += k * kue[i].value;
        s -= k * kue[i].weight;
    }
    cout << ans;
}

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