oj.uz

답안 #975631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975631 2024-05-05T15:10:37 Z vjudge1 Knapsack (NOI18_knapsack) C++17
12 / 100
 1 ms 348 KB 
#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.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -