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

int main(){
	const int MAX_N = 100;
	int N, A, B, C, D[MAX_N];
	int cal, val, res;
	
	scanf("%d", &N);
	scanf("%d%d", &A, &B);
	scanf("%d", &C);
	for(int i = 0; i < N; i++){
		scanf("%d", &D[i]);
	}
	
	sort(D, D + N, greater<int>());
	cal = C; val = A; res = C / A;
	for(int i = 0; i < N; i++){
		cal += D[i]; val += B;
		res = max(res, cal / val);
	}
	
	printf("%d\n", res);
	
	return 0;
}