Submission #580068

#TimeUsernameProblemLanguageResultExecution timeMemory
580068Yazan_SAOlivander (COCI18_olivander)C++14
50 / 50
1 ms264 KiB
#include<bits/stdc++.h> #define endl "\n" #define ll long long #define map unordered_map #define start cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); using namespace std; int main() { start //freopen("codeblocksinput.txt", "r", stdin); int t=1; //cin>>t; while(t--) { int n, x[100], y[100]; bool is=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); for(int i=0; i<n; i++) { if(y[i]<x[i]) { is=1; break; } } cout<<(is ? "NE" : "DA")<<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...