Submission #337657

#TimeUsernameProblemLanguageResultExecution timeMemory
337657aris12345678Olivander (COCI18_olivander)C++17
50 / 50
2 ms364 KiB
#include <bits/stdc++.h> using namespace std; const int mxN = 1e2+5; int n, x[mxN], y[mxN]; bool check() { for(int i = 0; i < n; i++) { if(y[i] < x[i]) return 0; } return 1; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> 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); if(check()) cout << "DA\n"; else cout << "NE\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...