Submission #635311

#TimeUsernameProblemLanguageResultExecution timeMemory
635311ZeroOlivander (COCI18_olivander)C++17
50 / 50
1 ms340 KiB
#include <bits/stdc++.h>
#define int long long

using namespace std;
const int MOD = 1e9 + 7;

signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    vector<int> a(n), b(n);
    for(int i=0; i < n; i++) cin >> a[i];
    for(int i=0; i < n; i++) cin >> b[i];
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    int k =0;
    for(int i=0; i < n; i++){
        if(b[i] >= a[i]) k ++;
    }
    cout << (k == n ? "DA" : "NE");

    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...