Submission #161527

#	Time	Username	Problem	Language	Result	Execution time	Memory
161527		ToniB	Olivander (COCI18_olivander)	C++14	50 / 50	2 ms	376 KiB

olivander

#include <iostream>
#include <algorithm>

using namespace std;


int main(){
	int n, x, y;
	cin >> n;
	int listx[n], listy[n], sol = 0;
	
	for(int i = 0; i < n; i++){
		cin >> x;
		listx[i] = x;
	}
	
	for(int i = 0; i < n; i++){
		cin >> y;
		listy[i] = y;
	}
	sort(listx, listx + n);
	sort(listy, listy + n);
	for(int i = 0; i < n; i++){
		if(listy[i] >= listx[i]){
	        sol += 1;
		}
		}
	if(sol == n){
		cout << "DA";
	}
	else{
		cout << "NE";
	}
	

	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5