#include<bits/stdc++.h>
using namespace std;
int n,a,b,s[500001];
int main(){
	cin>>n>>a>>b;
	for(int i=1;i<=n;i++)cin>>s[i];
	sort(s+1,s+n+1);
	int x=1,y=500000,mid=(x+y)/2;
	while(x<y){
		int sum=0;
		mid=(x+y)/2;
		for(int i=i;i<=n;i++){
			if(s[i]>mid*a)sum+=ceil(1.0*(s[i]-mid*a)/(a+b));
		}if(sum>mid){
			x=mid+1;
		}else{
			y=mid;
		}
	}cout<<mid;
	return 0;
}

OTZ