//AOJ 0567: Best Pizza
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX_N = 100;
int n, a, b, c, ans, cal = 0, cost = 0, tcal[MAX_N];
int main(){
	cin >> n >> a >> b >> c;
	for (int i = 0; i < n; i++){
		cin >> tcal[i];
	}
	ans = c / a;
	cost = a;
	cal = c;
	sort(tcal, tcal + n);
	for (int i = n - 1; i >= 0; i--){
		if (ans < tcal[i] / b){
			cal += tcal[i];
			cost += b;
			ans = cal / cost;
		}
	}
	cout << ans << endl;
}