#include<bits/stdc++.h>
using namespace std;
int n,A,B;
int f[500010];
int check(int c)
{
	int days=0;
	for(int i=1;i<=n;i++)
		if(f[i]>c*A)
			days+=ceil((f[i]-c*A)*1.0/B);
	if(days>c)
		return 0;
	else
		return 1;
}
int main()
{
	freopen("dry.in","r",stdin);
	freopen("dry.out","w",stdout); 
    cin>>n>>A>>B;
    for(int i=1;i<=n;i++)
        cin>>f[i];
    sort(f+1,f+n+1);
    int l=1;
    int r=f[n];
    int mid,ans=0;
    while(l<=r)
	{
        mid=(l+r)/2;
        if(check(mid)==1)
		{
            r=mid-1;
            ans=mid;
		} 
		else
            l=mid+1;
    }
    cout<<ans;
    return 0;
}