#include <iostream>
#include <algorithm>

#define int long long

using namespace std;

signed main(){
    int n, a, b, c, d[10002] = {0};
    cin >> n >> a >> b >> c;
    for(int i = 0; i < n; ++i){
        cin >> d[i];
    }

    sort(d, d + n, greater<int>());
    int max = 0, cal = c;

    for(int i = 0; i < n; ++i){
        c += d[i];
        int t = c / (a + b * (i + 1));
        if(max < t) max = t;
    }

    cout <<  max << endl;
    return 0;
}