Submission #580055

#TimeUsernameProblemLanguageResultExecution timeMemory
580055emad234Olivander (COCI18_olivander)C++17
50 / 50
1 ms340 KiB
#include <bits/stdc++.h> #define all(v) ((v).begin()),((v).end()) #define int long long using namespace std; const int mod = 998244353; const int mxN = 2e6 + 1; int a[mxN]; int b[mxN]; signed main() { ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); int n; cin >>n; for(int i = 0;i < n;i++){ cin >>a[i]; } for(int i = 0;i < n;i++){ cin >>b[i]; } sort(a,a + n); sort(b, b + n); for(int i =0;i < n;i++){ if(a[i] > b[i]){ cout<<"NE"; return 0; } } cout <<"DA"; } // nice
#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...