#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int t[100];
int s[100];

int main()
{
	int n; cin >> n;
	int a, b; cin >> a >> b;
	int c; cin >> c;

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

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

	s[0] = t[0];
	for (int i = 1; i < n; i++) s[i] = t[i] + s[i - 1];

	int ans = c / a;

	for (int i = 1; i <= n; ++i) {
		ans = max(ans, (c + s[i - 1]) / (a + b * i));
	}

	printf("%d\n", ans);
}