Submission #1018468

#TimeUsernameProblemLanguageResultExecution timeMemory
1018468vjudge1Olivander (COCI18_olivander)C++17
50 / 50
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int const N=2e5+5; int const mod=1e9+7; int main(){ int n; cin>>n; 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,a+n); sort(b,b+n); for (int i = 0; i < n; ++i) if(a[i]>b[i]){ cout<<"NE"<<endl; return 0; } cout<<"DA"<<endl; 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...