#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
using ll=long long;
using ld=long double;
using namespace std;
ll h[110000];
int main(){
    ll n,a,b,c,sum=0,tmp,ans=1e10;
    cin>>n>>a>>b;
    rep(i,0,n)cin>>h[i];
    c=a-b;
    sort(h,h+n);
    ll l=0,r=h[n-1];
    while(l<=r){
      sum=0;
      tmp=(r+l)/2;
      rep(i,0,n)sum+=max((ld)0,ceil(((ld)h[i]-tmp*b)/(ld)c));
      if(tmp>=sum){
        ans=min(ans,tmp);
        r=tmp-1;
      }
      else l=tmp+1;
    }
    cout<<ans;
}