제출 #570096

#제출 시각아이디문제언어결과실행 시간메모리
570096saarang123Olivander (COCI18_olivander)C++17
50 / 50
1 ms340 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
signed main() {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    int n; cin >> n;
    vector<int> a(n), b(n);
    for(int &x : a)
    	cin >> x;
    for(int &x : b)
    	cin >> x;
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    bool ok = true;
    for(int i = 0; i < n && ok; i++) 
    	ok = ok && (a[i] <= b[i]);
    cout << (ok ? "DA" : "NE") << '\n';
    return 0;
}
#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...