Submission #1018465

#TimeUsernameProblemLanguageResultExecution timeMemory
1018465vjudge1Olivander (COCI18_olivander)C++17
50 / 50
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; 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, x + n); sort(y, y + n); bool good = 1; for (int i = 0; i < n; i ++) good &= (x[i] <= y[i]); if (good) cout << "DA" << endl; else cout << "NE" << endl; }
#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...