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

int main(){
	int n,pa,pb,ca,cb[100],bc,tc = 0,tmp;
	cin >> n >> pa >> pb >> ca;
	for(int i = 0;i < n;++i){
		cin >> cb[i];
	}
	sort(cb,cb+n,greater<int>());
	bc = ca /pa;
	for(int i = 0;i < n;++i){
		tc += cb[i];
		tmp = (tc + ca) / (pa + (pb * (i + 1)));
		if(tmp > bc){
			bc = tmp;
		}
	}
	cout << bc << endl;
	return 0;
}