#include <bits/stdc++.h>
int n, bp, tp, r, t[100], i, c;
int cmp(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
  scanf("%d%d%d%d", &n, &bp, &tp, &c);
  for (i = 0; i < n; i++) scanf("%d", &t[i]);
  qsort(t, n, 4, cmp);
  for (i = r = 0; i < n; i++, tp += tp)
    c += t[i], r = r < c / (bp + tp) ? c / (bp + tp) : r;
  printf("%d\n", r);
  return 0;
}
