#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string st;
typedef bool bl;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
typedef vector<pii> vpi;
#define pu push
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define fast ios_base::sync_with_stdio(0);cin.tie();
#define test ll qqqqq;cin>>qqqqq;while(qqqqq--)
#define F first
#define S second
#define forn(i,n) for(ll i=0;i<n;i++)
#define forx(i,j,n) for(ll i=j;i<n;i++)
#define pb push_back
#define pob pop_back
#define all(v) v.begin(),v.end()
#define lb lower_bound
#define ub upper_bound
#define pof pop_front
#define pow powww
const ll dx[]{1,0,-1,0};
const ll dy[]{0,-1,0,1};
const ll inf=2e18;
const ll mod=1e9+7;
const ll M=1e6+1;
const ll MM=202;
const ll MMM=101;
const ld pi=acos(-1);
const ll mod1=1000000321;
ll n,a[M],b[M];
bl chk=1;
int main(){
fast
cin>>n;
forn(i,n)
cin>>a[i];
forn(i,n)
cin>>b[i];
sort(a,a+n);
sort(b,b+n);
forn(i,n){
if(a[i]>b[i])
chk=0;
}
if(chk)
cout<<"DA";
else
cout<<"NE";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
260 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 5 |
Incorrect |
19 ms |
2556 KB |
Output isn't correct |
| 6 |
Incorrect |
19 ms |
2588 KB |
Output isn't correct |
| 7 |
Incorrect |
18 ms |
2588 KB |
Output isn't correct |
