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

int main()
{
	int n;
	float a, b, c, cal[100];
	float ans;
	float save, sum = 0;
	
	scanf("%d %d %d %d", &n, &a, &b, &c);
	
	for (int i = 0; i < n; i++){
		scanf("%d", &cal[i]);
		c += cal[i];
	}
	
	sort(cal, cal + n);
	ans = c / (a + (b * n));
	
	for (int i = 0; i < n; i++){
		sum += cal[i];
		save = (c - sum) / (a + (b * (n - i - 1)));
		if (ans < save){
			ans = save;
		}
	}
	
	int best;
	best = (int)ans;
	
	printf("%d\n", best);
	
	return (0);
}