#include <bits/stdc++.h>
int main() {
  int n, a, b, base, top[100], cal[100];
  std::cin >> n >> a >> b >> base;
  for (int i = 0; i < n; i++) std::cin >> top[i];
  std::sort(top + 0, top + n);
  std::reverse(top + 0, top + n);
  for (int i = 0; i <= n; i++) {
    int all_cal = base;
    for (int j = 0; j < i; j++) all_cal += top[j];
    cal[i] = all_cal / (a + i * b);
  }
  std::sort(cal + 0, cal + n + 1);
  std::reverse(cal + 0, cal + n + 1);
  std::cout << cal[0] << std::endl;
  return 0;
}
