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

int n;
int a, b, c;
int d[1001];

int main(){
	std::cin >> n >> a >> b >> c;
	for (int i = 0; i < n; i++)std::cin >> d[i];

	std::sort(d, d + n,std::greater<int>());

	int max = 0;
	for (int i = 0; i < n; i++){
		max = std::max(max, c / (a + b * i) );
		c += d[i];
	}

	std::cout << max << std::endl;

	return 0;
}