Submission #1270218

#TimeUsernameProblemLanguageResultExecution timeMemory
1270218dgarcia09Olivander (COCI18_olivander)C++20
50 / 50
0 ms328 KiB
#include <bits/stdc++.h> #pragma GCC optimize ("O2") #define int long long #define endl '\n' #define vc vector<int> using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.setf(ios::fixed); cout.precision(0); int n; cin >> n; vc v(n), c(n); for(int i = 0; i < n; i++) cin >> v[i]; for(int i = 0; i < n; i++) cin >> c[i]; sort(v.begin(), v.end()); sort(c.begin(), c.end()); bool isP = true; for(int i = 0; i < n; i++) { if(v[i] > c[i]) { isP = false; break; } } cout << (isP ? "DA" : "NE") << 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...