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 <bits/stdc++.h>
#define all(v) ((v).begin()),((v).end())
#define int long long
using namespace std;
const int mod = 998244353;
const int mxN = 2e6 + 1;
int a[mxN];
int b[mxN];
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;
cin >>n;
for(int i = 0;i < n;i++){
cin >>a[i];
}
for(int i = 0;i < n;i++){
cin >>b[i];
}
sort(a,a + n);
sort(b, b + n);
for(int i =0;i < n;i++){
if(a[i] > b[i]){
cout<<"NE";
return 0;
}
}
cout <<"DA";
}
// nice
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |