Submission #45320217

---

Source Code Expand

#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>

#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using namespace std;


/*
ll pw(ll a, ll b) {
	ll ans = 1; while (b) {
		while (!(b & 1)) b >>= 1, a = (a * a) % MOD;
		ans = (ans * a) % MOD, --b;
	} return ans;
}
*/

int main() {
	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cout.setf(ios::fixed), cout.precision(20);
	int n, m, a, b;
	cin >> n >> m >> a >> b;
	vector<int> cnt(n, 0);
	for (int i = 0; i < m; ++i) {
		int x;
		cin >> x;
		--x;
		++cnt[x];
	}
	sort(ALL(cnt));
	int cur = b;
	int ans = n;
	for (int x : cnt) {
		if (x <= cur) {
			cur -= x;
			ans -= 1;
		}
	}
	ans = min(ans, a - b);
	cout << n - ans << "\n";
	return 0;
}

Submission Info

Judge Result