#include <bits/stdc++.h>
using namespace std;
int n, A, B, Ac, Bc[100];
double t, last_t;
int main() {
  cin >> n >> A >> B >> Ac;
  for (int i = 0; i < n; i++) {
    cin >> Bc[i];
  }
  sort(Bc, Bc + n, greater<int>());
  last_t = (double)Ac / A;
  for (int i = 0; i < n; i++) {
    Ac += Bc[i];
    A += B;
    t = Ac / A;
    if (t < last_t) {
      break;
    }
    last_t = t;
  }
  printf("%d\n", (int)last_t);
}
