#include<iostream>
#include<algorithm>
#include<functional>

using namespace std;

int main(){
	int n,a,b,kiji;
	int toppingu[1000];
	int besuto=0;
	cin>>n>>a>>b>>kiji;
	for(int i=0;i<n;i++){
		cin>>toppingu[i];
	}
	int all=kiji;
	sort(toppingu,toppingu+n,greater<int>());
	for(int i=0;i<=n;i++){
		besuto=max(besuto,(all)/(a+b*i));
		all+=toppingu[i];
	}
	cout<<besuto<<endl;
	return 0;
}