#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
	int n, a, b, c, d[100], i;
	double sm, sv, t, u;
	cin >> n >> a >> b >> c;
	for (i = 0; i < n; i++)
		cin >> d[i];
	sort(d, d+n, greater<int>());
	sm = (double)a, sv = (double)c;
	for (i = 0; i < n; i++)
	{
		t = (sv+d[i])/(sm+b);
		u = sv/sm;
		if (t > u)
			sv+=d[i], sm+=b;
	}
	cout << (int)(sv/sm) << endl;
}