#include <bits/stdc++.h>
int main() {
  int n, a, b, c, d[100];
  int i, maxi;
  double max, cal[100], tmp;
  scanf("%d%d%d%d", &n, &a, &b, &c);
  for (i = 0; i < n; i++) {
    scanf("%d", &d[i]);
    cal[i] = (double)d[i] / (double)b;
  }
  tmp = (double)c / (double)a;
  int j = 1;
  while (++j) {
    for (maxi = -1, max = tmp, i = 0; i < n; i++) {
      if (max < cal[i]) {
        max = cal[i];
        maxi = i;
      }
    }
    if (maxi == -1) break;
    tmp = (tmp * (a + (j - 2) * b) + cal[maxi] * b) / (a + (j - 1) * b);
    cal[maxi] = 0;
  }
  printf("%.0f\n", tmp);
  return 0;
}
