#include<iostream>
#include<algorithm>
using namespace std;

int main(){
	int n,piza,topping,piza_k;
	
	cin>>n;
	cin>>piza;
	cin>>topping;
	cin>>piza_k;
	
	int topping_k[n];
	
	for(int i=0;i<n;i++) cin>>topping_k[i];
	sort(topping_k,topping_k + n);
	
	int max=piza_k/piza;
	int sum_d=piza,sum_k=piza_k;
	for(int i=n-1;i>=0;i--){
		sum_d+=topping;
		sum_k+=topping_k[i];
		if(max<=sum_k/sum_d) max=sum_k/sum_d;
		else break;
	}
	cout<<max<<endl;
return 0;
}