Submission #472949

#TimeUsernameProblemLanguageResultExecution timeMemory
472949blueOlivander (COCI18_olivander)C++17
50 / 50
1 ms204 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int N; cin >> N; vector<int> x(N), y(N); for(int i = 0; i < N; i++) cin >> x[i]; for(int j = 0; j < N; j++) cin >> y[j]; sort(x.begin(), x.end()); sort(y.begin(), y.end()); for(int i = 0; i < N; i++) { if(x[i] > y[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...