Submission #133803

#	Time	Username	Problem	Language	Result	Execution time	Memory
133803		tdwn	Kralj (COCI16_kralj)	C++17	42 / 140	1095 ms	19184 KiB

kralj

#include <bits/stdc++.h>
#define ll long long 
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 500100;
int n, a[maxn], d[maxn], s[maxn];

int main() {
	cin>>n;
	for(int i=1;i<=n;i++) {
		cin>>a[i];
	}
	for(int i=1;i<=n;i++) {
		cin>>d[i];
	}
	for(int i=1;i<=n;i++) {
		cin>>s[i];
	}

	sort(d, d+n);
	sort(s, s+n);
	int br = 0;
	int i=1, j=1;
	while(i <=n && j<=n) {
		if(s[j] > d[i]) {
			br++;
			j++;
			i++;
		}
		else if(s[j] <= d[i]) {
			j++;
		}
	}
	cout<<br<<"\n";
}

• Subtask 1: 42 / 140