Submission #6507997

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;

int main() {
	ll N, A, B;
	cin >> N >> A >> B;
	vector<ll> h(N);
	for(ll i=0; i<N; ++i){
	    cin >> h[i];
	}
	sort(h.begin(), h.end(), greater<ll>());
	if(N==1){
	    cout << (h[0]+A-1)/A << endl;
	    return 0;
	}
	if(h[0]<=A && h[1]<=B){
	    cout << 1 << endl;
	    return 0;
	}
	ll left=1, right=(h[0]+B-1)/B;
	while(left+1<right){
	    ll mid=(left+right+1)/2, cnt=0;
	    for(ll i=0; i<N; ++i){
	        if(h[i]>B*mid) cnt += (h[i]-B*mid+A-B-1)/(A-B);
	        else break;
	    }
	    if(cnt<=mid) right=mid;
	    else left=mid;
	}
	cout << right << endl;
	return 0;
}

Submission Info

Judge Result