제출 #1270588

#제출 시각아이디문제언어결과실행 시간메모리
1270588eliodrOlivander (COCI18_olivander)C++20
50 / 50
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; vector <long long> v1; vector <long long> v2; int main() { int n; cin >> n; for (int i=0;i < n;i++){ long long a;cin >> a; v1.push_back(a); } for (int i=0;i < n;i++){ long long b;cin >> b; v2.push_back(b); } sort(v1.begin(),v1.end()); sort(v2.begin(),v2.end()); for (int i=0;i < n;i++){ if (v1[i]> v2[i]){ cout <<"NE"<<endl; return 0; } } cout <<"DA"<<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...