Submission #472955

#TimeUsernameProblemLanguageResultExecution timeMemory
472955blueOlivander (COCI18_olivander)C++17
50 / 50
1 ms256 KiB
#include <iostream> #include <algorithm> using namespace std; int main(){int N;cin >> N;int a[2*N];for(int&f:a)cin>>f;sort(a,a+N);sort(a+N,a+2*N);for(int i=0;i<N;i++)if(a[i]>a[N+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...