#include <bits/stdc++.h>
int main(void) {
  int box, n, t[101] = {0}, y = 0, a, b, cnt2, cnt, max = 0;
  scanf("%d %d %d %d", &n, &a, &b, &t[0]);
  for (cnt = 1; cnt <= n; cnt++) {
    scanf("%d", &t[cnt]);
  }
  for (cnt = 1; cnt <= n; cnt++) {
    for (cnt2 = 1; cnt2 <= n; cnt2++) {
      if (t[cnt2] < t[cnt + 1]) {
        box = t[cnt2];
        t[cnt2] = t[cnt2 + 1];
        t[cnt2 + 1] = box;
      }
    }
  }
  cnt2 = 0;
  for (cnt = 1; cnt < n; cnt++) {
    y += t[cnt];
    cnt2++;
    if (max < (y + t[0]) / (a + cnt2 * b)) {
      max = (y + t[0]) / (a + cnt2 * b);
    }
  }
  printf("%d\n", max);
  return 0;
}
