Submission #168301

#TimeUsernameProblemLanguageResultExecution timeMemory
168301aydinenesOlivander (COCI18_olivander)C++11
50 / 50
2 ms376 KiB
#include<bits/stdc++.h>

#define mid(l,r) ((l+r)/2)

using namespace std;

const int N = 1e5+7;
const int inf=1e9+7;

int n;

int w[N], b[N];

int main(){
	
	cin >> n;
	
	for(int i = 0; i < n; i++){
		cin >> w[i];
	}
	
	for(int i = 0; i < n; i++){
		cin >> b[i];
	}
	
	sort(w, w + n);
	sort(b, b + n);
	
	for(int i = 0; i < n; i++){
		if(w[i] > b[i]){
			cout << "NE";
			return 0;
		}
	}
	
	cout << "DA";
}




#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...