#include<cstdio>
#include<algorithm>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int main(){
	int n,cost_kiji,cost,cal_kiji;
	scanf("%d%d%d%d",&n,&cost_kiji,&cost,&cal_kiji);
	int cal[100];
	rep(i,n) scanf("%d",cal+i);

	sort(cal,cal+n);

	int ans=cal_kiji/cost_kiji;
	int cal_sum=cal_kiji;
	rep(i,n){
		cal_sum+=cal[n-i-1];
		ans=max(ans,cal_sum/(cost_kiji+(i+1)*cost));
	}
	printf("%d\n",ans);

	return 0;
}