Submission #637689

#	Time	Username	Problem	Language	Result	Execution time	Memory
637689		VitaliyFS	Exam (eJOI20_exam)	C++17	0 / 100	4 ms	596 KiB

exam

#include<bits/stdc++.h>

using namespace std;

#define fr first
#define sc second

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

const ll INF = 1000000000000000007, DIM = 200007, DIM2 = 27, MAXN = 100007, MOD = 1000000007;

ll tt, mid, res,f, y, type, ptr, root, cnt, sum, pos, h, p, sx,sy, id, testcase, curans, nn, split, n, m, x, k1, k2, changecnt,k,l,r,v,u, l1,r1,l2,r2;
bool flag, flag2;
char c;
pll a[DIM];
map<ll,ll> used;

void solve() {
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].fr;
	}
	for(int i=1;i<=n;i++){
		cin>>a[i].sc;
		used[a[i].sc]++;
	}
	for(int i=1;i<=n;i++) if(used[a[i].fr]==0)cnt++;
	sort(a+1,a+1+n);
	for(int i=n;i>=1;i--) {
		if(used[a[i].fr]) {
			res++;used[a[i].fr]--;
			while(used[a[i].fr]>0&&cnt>0) {
				cnt--;used[a[i].fr]--;res++;
			}
		} else cnt--;
	}
	cout<<res<<'\n';
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	tt=1;
	// freopen("input.txt","r",stdin);
	// freopen("output.txt","w",stdout);
	//cin>>tt;
	while(tt--) {
		solve();
	}
	return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22