#include <bits/stdc++.h>
using namespace std;
int n, a, b, c, p;
int main() {
  scanf("%d", &n);
  scanf("%d %d", &a, &b);
  scanf("%d", &c);
  std::vector<int> cal(n);
  for (int j = 0; j < n; j++) {
    scanf("%d", &cal[j]);
  }
  sort(cal.begin(), cal.end(), greater<int>());
  int max = c / a;
  for (int k = 0; k < n; k++) {
    int t = 0;
    for (int l = 0; l < k; l++) t = +cal[l];
    p = (c + t) / (a + k * b);
    if (p > max) max = p;
  }
  int bp = int(max);
  printf("%d", bp);
  return 0;
}
