Submission #2239014

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long cc;
const int N = 100005;
int n, A, B;
int h[N];
bool check(const int &m) {
    cc sum = 0;
    for (int i = 0; i < n; i++)
        if (h[i] - 1ll * m * B > 0) {
            int val = max(0ll, (h[i] - 1ll * m * B) / (A - B)  + ((h[i] - 1ll * m * B) % (A - B) > 0 ) );
            sum += val;
        }
    return sum <= m;
}
int main() {
//	freopen("input.inp", "r", stdin);
	//freopen("output.out", "w", stdout);
    //freopen("udtseq2.out", "w", stdout);
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int lo = 0, hi = 1000000000;

    cin >> n >> A >> B;
    for (int i = 0; i < n; i++) cin >> h[i];
    //cout << check (800000001) << " sda\n";
    while (lo <= hi) {
        int mi = (lo + hi) >> 1;
        if (check(mi))
            hi = mi - 1;
        else
            lo = mi + 1;
    }
    cout << hi + 1;
    return 0;
}

Submission Info

Judge Result