#include <iostream>
#include <algorithm>
#include <functional>

	using namespace std;

	int main(){
		int n = 0, a = 0, b = 0, c = 0, d[10001] = {}, cal,pre,cur, i;
		cin >> n >> a >> b>> c;

		for (i = 0; i < n; i++){
			cin >> d[i];
		}
		sort(d, d + n, greater<int>());
		cal = c;
		pre = cal / a;
		for (i = 0; i < n; i++){
			
			cal += d[i] ;
			cur = cal / (b*(i + 1)+a);
			if (pre > cur) {
				break;
			}
			pre = cur;
		}
		cout << pre << endl;
		return 0;
	}
	