Submission #409187

#TimeUsernameProblemLanguageResultExecution timeMemory
409187snasibov05Olivander (COCI18_olivander)C++14
50 / 50
1 ms364 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 i = 0; i < n; ++i){ cin >> y[i]; } 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"; 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...