#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int n;
  int kiji, top;
  int kijical;
  int cal[101] = {0};
  int tmp;
  int m;
  int best = 0;
  int i, j;
  cin >> n;
  cin >> kiji >> top;
  cin >> kijical;
  for (i = 1; i <= n; i++) {
    cin >> cal[i];
    for (j = 0; j < i; j++) {
      if (cal[j] < cal[i]) {
        tmp = cal[i];
        cal[i] = cal[j];
        cal[j] = tmp;
      }
    }
  }
  for (i = n / 2; i >= 0; i--) {
    int calm = 0;
    for (j = 0; j <= i; j++) {
      calm += cal[j];
    }
    m = kiji + (top * j);
    calm = (kijical + calm) / m;
    if (best < calm) {
      best = calm;
    }
  }
  cout << best << endl;
  return 0;
}
