Submission #1521548

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
const ll INF = 1000000000000000000ll;
const ll MOD = 1000000007ll;
const double EPS = 1e-8;
ll n, a, b;
vector<ll> h;
bool check(ll m){
	ll cnt = 0;
	for(int i=0; i<n; i++){
		if(h[i] - m*b > 0){
			cnt += (h[i] - m*b) / (a-b)+((h[i]-m*b)%(a-b)!=0);
		}
	}
	return cnt <= m;
}
 
int main(void) {
	//ios_base::sync_with_stdio(false);
	//cin.tie(0);
	cin >> n >> a >> b;
 
	ll ma = 0;
	for(int i=0; i<n; i++){
		ll t;
		cin >> t;
		h.pb(t);
		ma = max(ma, t);
	}
 
	ll l = 0;
	ll r = ma/b + 1;
 
	while(r-l > 1){
		ll m = (l + r)/2;
		if(check(m)){
			r = m;
		}else{
			l = m;
		}
	}
 
	cout << r << endl;
	
	return 0;
}

Submission Info

Judge Result