제출 #472950

#제출 시각아이디문제언어결과실행 시간메모리
472950blueOlivander (COCI18_olivander)C++17
50 / 50
1 ms204 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<int> x(N), y(N);
    for(vector<int>* a: {&x, &y})
        for(int i = 0; i < N; i++)
            cin >> (*a)[i];
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    for(int i = 0; i < N; i++)
    {
        if(x[i] > y[i])
        {
            cout << "NE\n";
            return 0;
        }
    }
    cout << "DA\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...