Submission #1433600

---

Source Code Expand

#include <iostream>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
using namespace std;
typedef long long ll;

int N;
ll A, B, H[100000];

bool ok(ll n) {
  ll cnt = 0;
  REP(i, 0, N) if(H[i] > B * n) {
    cnt += (H[i] - B * n) / (A - B);
    if((H[i] - B * n) % (A - B) != 0) cnt++;
  }
  return cnt <= n;
}

int main(void) {
  cin >> N >> A >> B;
  REP(i, 0, N) cin >> H[i];

  ll l = 0, r = 10000000000LL;
  while(l + 1 < r) {
    ll m = (l + r) / 2;
    if(ok(m)) r = m;
    else l = m;
  }

  cout << r << endl;
}

Submission Info

Judge Result