#include<stdio.h>
#include<algorithm>
#include<functional>
using namespace std;
typedef pair<int, int>P;

int main(){
	int n, a, b, c, d[100];
	scanf("%d%d%d%d", &n, &a, &b, &c);
	P best(c, a);
	for (int i = 0; i < n; i++)
		scanf("%d", &d[i]);
	sort(d, d + n, greater<>());
	for (int i = 0; i < n; i++){
		if (best.first / best.second < (best.first + d[i]) / (best.second + b))
			best = P(best.first + d[i], best.second + b);
		else break;
	}
	printf("%d\n", best.first / best.second);
	return 0;
}