Submission #1868006

---

Source Code Expand

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

const int N = 100005;

int n, h[N], A, B;
long long H[N];

bool check(int val) {
	for (int i = 1; i <= n; ++i) H[i] = h[i] - 1LL * val * B; // H[i]: long long
	long long cnt = 0;
	for (int i = 1; i <= n; ++i) if (H[i] > 0) {
		cnt += (H[i] + A - 1) / A;
	}
	return cnt <= val;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> A >> B;
	A -= B;
	for (int i = 1; i <= n; ++i) cin >> h[i];

	// use binary search optimal sum
	int l = 0, r = 1e9;
	while(l < r) {
		int mid = ((l + r) >> 1);
		if (check(mid)) r = mid; else l = mid + 1;
	}
	cout << l << endl;
}

Submission Info

Judge Result