Submission #1613370

---

Source Code Expand

#include <iostream>
#include <math.h>

using namespace std;  
typedef long long LL;

int N, A, B, h[(int)1e5];

bool judge(LL K) {
    LL sum = 0;
    for(int i = 0; i < N; i++) {
        LL t = (LL)h[i]-K*B;
        if (t > 0) {
            sum += (int)ceil(t*1.0/(A-B));
            if(sum > K)
                return false;
        }
    }
    return true;
}

int main()
{
    cin >> N >> A >> B;

    for (int i = 0; i < N; i++) {
        cin >> h[i];
    }

    LL low = 0, high = (int)1e9;

    while (low < high) {
        LL mid = (low + high) / 2;
        if (judge(mid))
            high = mid;
        else
            low = mid+1;
    }

    cout << low << endl;

    return 0;
}

Submission Info

Judge Result