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

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