Submission #1175484

#	Time	Username	Problem	Language	Result	Execution time	Memory
1175484		Nomio	Kralj (COCI16_kralj)	C++20	56 / 140	286 ms	29840 KiB

kralj

#include<bits/stdc++.h>
using namespace std;
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	int a[n], p[n], v[n];
	for(int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for(int i = 0; i < n; i++) {
		cin >> p[i];
	}
	multiset<int> s;
	for(int i = 0; i < n; i++) {
		cin >> v[i];
		s.insert(v[i]);
	}
	sort(p, p + n);
	int ans = 0;
	for(int i = 0; i < n; i++) {
		if(*--s.end() > p[i]) {
			ans++;
			int x = *s.lower_bound(p[i]);
			s.erase(s.find(x));
		}
	}
	cout << ans << '\n';
	return 0;
}

• Subtask 1: 56 / 140