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

int main() {
	int inmu, yj, hide, kiji, db, hage[10000] = {};
	cin >> inmu;
	cin >> yj >> hide;
	cin >> kiji;
	for(int i = 0; i < inmu; i++){
		cin >> hage[i];
	}
	sort(hage, hage + inmu, greater<int>());
	for(int i = 0; i < inmu; i++){
		db = kiji / (yj + hide * i);
		kiji += hage[i];
		if(db > kiji / (yj + hide * (i + 1))){
			cout << db << endl;
			break;
		}
	}
	return 0;
}