Submission #316894

#	Time	Username	Problem	Language	Result	Execution time	Memory
316894		CodeTiger927	Kralj (COCI16_kralj)	C++14	0 / 140	1223 ms	8184 KiB

kralj

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