Submission #86001

# Submission time Handle Problem Language Result Execution time Memory
86001 2018-11-23T20:31:04 Z MatesV13 Olivander (COCI18_olivander) C++11
50 / 50
5 ms 844 KB
#include <bits/stdc++.h>
using namespace std;
multiset<int> s1, s2;
long long n, x, ok = 1;
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
	cin >> n;
	for (int i=0;i<n;i++){
		cin >> x;
		s1.insert(x);
	}
	for (int i=0;i<n;i++){
		cin >> x;
		s2.insert(x);
	}
	set<int>:: iterator it1 = s1.begin();
	set<int>:: iterator it2 = s2.begin();
	for (int i=0;i<n;i++){
		if (*it1 <= *it2){
			it1++;
			it2++;
		}
		else ok = 0;
	}
	if (ok) cout << "DA";
	else cout << "NE";
return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 416 KB Output is correct
2 Correct 2 ms 420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 472 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 572 KB Output is correct
2 Correct 2 ms 576 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 2 ms 816 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 2 ms 844 KB Output is correct