#include <algorithm>
#include <iostream>

using namespace std;

int n, a, b, c;
int d[105];

int main() {
    cin >> n >> a >> b >> c;

    for (int i = 0; i < n; i++) {
        cin >> d[i];
    }

    sort(d, d + n, greater<int>());

    int sum = c;
    int maxV = 0;

    for (int k = 0; k < n; k++) {
        sum += d[k];
        maxV = max(maxV, sum / (a + b * (k + 1)));
    }

    cout << maxV << endl;
}