#include <algorithm>
#include <iostream>

using namespace std;

int n;
int A, B, C;
int D[100];
int main() {
    cin >> n;
    cin >> A >> B;
    cin >> C;
    for (int i = 0; i < n; i++) {
        cin >> D[i];
    }

    
    sort(D, D + n);
    reverse(D, D + n);
    
    int max,cal=C,wa;
    wa=C/A;
    max=wa;
    for (int i = 0; i < n; i++) {
    	cal+=D[i];
    	A+=B;
    	wa=cal/A;
    	if(wa>max) max=wa;
    }
    cout << max << endl;

    return 0;
}