# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976643 | 2024-05-06T23:49:11 Z | vjudge1 | Knapsack (NOI18_knapsack) | C++17 | 0 ms | 0 KB |
#include <iostream> 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; }