#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int len, n, i, j, x, a, b, c, kr[10001], max = -1, cnt = 1, p, su;
  scanf("%d", &n);
  scanf("%d %d", &a, &b);
  scanf("%d", &c);
  for (i = 0; i < n; i++) {
    scanf("%d", &kr[i]);
  }
  sort(kr, kr + n, greater<int>());
  su = c / a;
  for (i = 0; i < n; i++) {
    if (i != 0) {
      p += kr[i];
    } else {
      p = kr[i] + c;
    }
    b = b * cnt;
    x = p / (b + a);
    if (max < x) {
      max = x;
    } else {
      break;
    }
    cnt++;
  }
  if (max > su) {
    printf("%d\n", max);
  } else {
    printf("%d\n", su);
  }
  return 0;
}
