Submission #161527

# Submission time Handle Problem Language Result Execution time Memory
161527 2019-11-02T22:21:01 Z ToniB Olivander (COCI18_olivander) C++14
50 / 50
2 ms 376 KB
#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;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 348 KB Output is correct