oj.uz

Submission #316894

# Submission time Handle Problem Language Result Execution time Memory
316894 2020-10-28T13:44:00 Z CodeTiger927 Kralj (COCI16_kralj) C++14
0 / 140
 1223 ms 8184 KB 
using namespace std;

#include <iostream>
#include <algorithm>

#define MAXN 500005

int arr[MAXN],strM[MAXN],strS[MAXN],N;

int main() {
	cin >> N;
	for(int i = 0;i < N;++i) cin >> arr[i];
	for(int i = 0;i < N;++i) cin >> strM[i];
	for(int i = 0;i < N;++i) cin >> strS[i];
	
	sort(strM,strM + N);
	sort(strS,strS + N);

	int ans = 0;
	for(int i = 0;i < N;++i) {
		if(strS[i] > strM[N - 1 - i]) ans++;
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 840 ms 6904 KB Output isn't correct
2 Incorrect 788 ms 6840 KB Output isn't correct
3 Incorrect 988 ms 7928 KB Output isn't correct
4 Incorrect 968 ms 8184 KB Output isn't correct
5 Incorrect 1103 ms 7516 KB Output isn't correct
6 Incorrect 1065 ms 7348 KB Output isn't correct
7 Incorrect 1158 ms 7656 KB Output isn't correct
8 Incorrect 1028 ms 7204 KB Output isn't correct
9 Incorrect 1223 ms 7944 KB Output isn't correct
10 Incorrect 1160 ms 8072 KB Output isn't correct