#include<stdio.h>
#include<algorithm>
#include<functional>
#include<iostream>
using namespace std;
int main()
{
	int i, n, a, b, c, d[10000],g,max;
	scanf("%d", &n);
	scanf("%d %d", &a, &b);
	scanf("%d", &c);
	for (i = 0; i < n; i++){
		scanf("%d", &d[i]);
	}
	sort(d, d + n, greater<int>());
	max = c / a;
	for (i = 1; i <= n; i++){
		g = 0;
		for (int i2 = 0; i2 < i; i2++){
			g += d[i2];
		}
		g = (g + c) / (a + i*b);
		if (max < g)
			max = g;

	}
	printf("%d\n", max);
	return 0;
}