| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1160781 | johar444555 | Olivander (COCI18_olivander) | C++20 | 0 ms | 0 KiB | 
#include <chrono>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
using namespace std;
typedef long long ll;
int main() {
    int n;
    cin >> n;
    std::vector<int> wand(n);
    std::vector<int> box(n);
    std::vector<bool> isempty(n, true);
    for (int i = 0; i < n; ++i) {
        cin >> wand[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> box[i];
    }
    std::sort(wand.begin(), wand.end());
    std::reverse(wand.begin(), wand.end());
    std::sort(box.begin(), box.end());
    for (int i = 0; i < n; ++i) {
        bool isok = false;
        for (int j = 0; j < n; ++j) {
            if (isempty[j] && wand[i] <= box[j]) {
                isempty[j] = false;
                isok = true;
                break;
            }
        }
        if (isok) { continue; }
        cout << "NE";
        return 0;
    }
    cout << "DA";
    return 0;
}
