Submission #1019548

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019548		vjudge1	Olivander (COCI18_olivander)	C++17	50 / 50	1 ms	604 KiB

olivander

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

using namespace std;

string can_place_wands_in_boxes(int N, vector<int>& wand_lengths, vector<int>& box_sizes) {

    sort(wand_lengths.begin(), wand_lengths.end());
    sort(box_sizes.begin(), box_sizes.end());

    for (int i = 0; i < N; ++i) {
        if (wand_lengths[i] > box_sizes[i]) {
            return "NE";
        }
    }

    return "DA";
}

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

    vector<int> wand_lengths(N);
    vector<int> box_sizes(N);

    for (int i = 0; i < N; ++i) {
        cin >> wand_lengths[i];
    }

    for (int i = 0; i < N; ++i) {
        cin >> box_sizes[i];
    }

    string result = can_place_wands_in_boxes(N, wand_lengths, box_sizes);
    cout << result << endl;

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5