Submission #25844

#	Time	Username	Problem	Language	Result	Execution time	Memory
25844		szawinis	Kralj (COCI16_kralj)	C++14	0 / 140	603 ms	20232 KiB

kralj

#include <bits/stdc++.h>
using namespace std;
const int MAX = (3e5)+1;

int n, start, ans, a[MAX], tmp[MAX], d[MAX], e[MAX];
bool mark[MAX];
multiset<int> st;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for(int i = 0; i < n; i++) cin >> a[i], --a[i];
	copy(a, a+n, tmp);
	sort(tmp, tmp+n);
	int curr = 0;
	for(int x: tmp) {
		if(mark[x]) curr = (curr+1)%n;
		else curr = start = x;
		mark[curr] = true;
	}
	for(int i = 0; i < n; i++) cin >> d[i];
	for(int i = 0, x; i < n; i++) {
		cin >> x;
		st.insert(x);
	}
	for(int z = 0, i = start; z < n; z++, i = (i+1)%n) {
		auto it = st.lower_bound(d[i]);
		if(it != st.end()) ans++, st.erase(it);
	}
	cout << ans;
}

• Subtask 1: 0 / 140