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

int main(){
	int i,n,bp,tp,bc,tc[100],input,maxc,tmpc,cc;
	cin >> n >> bp >> tp >> bc;
	for(i = 0;i < n;i++){
		cin >> input;
		tc[i] = input;
	}
	sort(tc,tc+n,greater<int>());
	maxc = bc / bp;
	tmpc = bc;
	for(i = 0;i < n;i++){
		tmpc += tc[i];
		cc = tmpc / (bp + (tp * (i + 1)));
		if(cc > maxc) maxc = cc;
	}
	cout << maxc << endl;
	return 0;
}