提出 #9182244

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 100005;

int a[MX];
int n, m, v, p;

bool can(int x)
{	
	ll rem = (v - 1) * 1LL * m;
	
	int cc = p - 1;
	for (int j = 1; j <= n; j++) {
		if (j == x) continue;
		if (cc) {
			rem -= m;
			cc--;
		}
		else {
			rem -= min(m, a[x] + m - a[j]);
			if (a[x] + m < a[j]) return false;
		}
	}
		
	return rem <= 0;
}

int main()
{
	ignore = scanf("%d %d %d %d", &n, &m, &v, &p);
	
	for (int i = 1; i <= n; i++) {
		ignore = scanf("%d", a + i);
	}
	sort(a + 1, a + n + 1);
	reverse(a + 1, a + n + 1);
	
	int L = 1, R = n;
	int ans = 0;
	
	while (L <= R) {
		int M = (L + R) / 2;
		if (can(M)) {
			ans = M;
			L = M + 1;
		}
		else {
			R = M - 1;
		}
	}
	printf("%d\n", ans);
}

提出情報

ジャッジ結果