#include <bits/stdc++.h>
using namespace std;
long long int n, kcost, cost, kiji, ans;
long long int piza[1003];
long long int much_pizza(long long int m, long long int kal,
                         long long int num) {
  if (num > n)
    return kal / (m * cost + kcost);
  else {
    return max(much_pizza(m + 1, kal + piza[num], num + 1),
               much_pizza(m, kal, num + 1));
  }
}
signed main() {
  cin >> n >> kcost >> cost >> kiji;
  for (long long int i = 0; i < n; i++) {
    cin >> piza[i];
  }
  ans = kiji;
  long long int now = 0, before = 0;
  sort(piza, piza + n);
  for (long long int i = n - 1, j = 1; i > 0, j <= n; i--, j++) {
    ans += piza[i];
    now = ans / (j * cost + kcost);
    if (now <= before) {
      break;
    }
    before = now;
  }
  cout << now << endl;
  return 0;
}
