#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  double d[10000], a, b, c;
  cin >> n >> a >> b >> c;
  for (int i = 0; i < n; i++) {
    cin >> d[i];
  }
  sort(d, d + n);
  int k = 1;
  double max, sum = d[n - 1];
  max = (sum + c) / (a + k * b);
  for (int i = n - 1; i > 0; i--) {
    for (int j = i - 1; j > 0; j--) {
      if (max < (c + sum + d[j]) / (a + (k + 1) * b)) {
        k++;
        sum += d[j];
        max = (c + sum) / (a + k * b);
      } else
        goto end;
    }
  }
end:
  int ans = (int)max;
  printf("%d\n", ans);
  return 0;
}
