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

int main()
{
	int n, a, b, c;
	int d[100];

	cin >> n >> a >> b >> c;

	for (int i = 0; i < n; i++)
		cin >> d[i];

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

	int m = 0, nr = c, dr = a, m1 = nr / dr;

	for (int i = 0; i < n; i++) {
		m = max(m, m1);
		nr += d[i];
		dr += b;
		m1 = nr / dr;
	}

	cout << m << endl;

	return 0;
}

