#include <bits/stdc++.h>
int sortfnc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main(void) {
  int i, n, a, b, c, t[128], nm, nc;
  scanf("%d%d%d%d", &n, &a, &b, &c);
  for (i = 0; i < n; i++) {
    scanf("%d", &t[i]);
  }
  qsort(t, n, sizeof(int), sortfnc);
  nm = a;
  nc = c;
  for (i = 0; i < n; i++) {
    if ((nc / nm) >= ((nc + t[i]) / (nm + b))) {
      break;
    }
    nc += t[i];
    nm += b;
  }
  printf("%d\n", nc / nm);
  return 0;
}
