# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409186 | snasibov05 | Olivander (COCI18_olivander) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n; cin >> n;
vector<int> x(n), y(n);
for (int i = 0; i < n; ++i) {
cin >> x[i];
}
for (int i = 0; i < n; ++i){
cin >> y[i];
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
for (int i = 0; i < n; ++i){
if (x[i] > y[i]){
cout << "NE\n";
return 0;
}
}
cout << "DA\n";
return 0;
}