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

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

int main(){
	int n,a,b,c,d[100];
	cin >> n >> a >> b >> c;
	rep(i,n)  cin >> d[i];
	sort( d, d+n );
	int sval = a, scal = c;
	for(int i=n-1; i>=0; i--){
		if( (double)scal/(double)sval < (double)(scal+d[i])/(double)(sval+b) ){
			sval += b;
			scal += d[i];
		}else  break;
	}
	cout << (int)((double)scal/(double)sval) << endl;
	return 0;
}