제출 #975631

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975631		vjudge1	Knapsack (NOI18_knapsack)	C++17	12 / 100	1 ms	348 KiB

knapsack

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Cake {
    int value;
    int weight;
    int quantity;
};

bool cmp(const Cake& a, const Cake& b) {
    return (double)a.value / a.weight > (double)b.value / b.weight;
}

int main() {
    int S, N;
    cin >> S >> N;

    vector<Cake> cakes(N);
    for (int i = 0; i < N; i++) {
        cin >> cakes[i].value >> cakes[i].weight >> cakes[i].quantity;
    }

    sort(cakes.begin(), cakes.end(), cmp);

    int maxValue = 0;
    int remainingWeight = S;

    for (const Cake& cake : cakes) {
        int maxQuantity = min(cake.quantity, remainingWeight / cake.weight);
        maxValue += maxQuantity * cake.value;
        remainingWeight -= maxQuantity * cake.weight;
    }

    cout << maxValue << endl;
    return 0;
}

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