Submission #1018467

#TimeUsernameProblemLanguageResultExecution timeMemory
1018467vjudge1Olivander (COCI18_olivander)C++17
50 / 50
1 ms348 KiB
#include<bits/stdc++.h> using namespace std; #define yes "DA" #define no "NE" int main() { int n; cin >> n; int w[n], b[n]; for(int i = 0; i < n; i ++) cin >> w[i]; for(int i = 0; i < n; i ++) cin >> b[i]; sort(w, w + n); sort(b, b + n); for(int i = 0; i < n; i ++) if(w[i] > b[i]) { cout << no << endl; return 0; } cout << yes << 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...