#include<iostream>
#include<algorithm>

using namespace std;

#define rep(i, n) for (int i = 0; i < int(n); ++i)

int main() {
  int n, a, b, c, cal[100], res, s;
  cin >> n >> a >> b >> c;
  rep (i, n) cin >> cal[i];
  sort(cal, cal + n, greater<int>());
  s = c;
  res = s / a;
  rep (i, n) {
    s += cal[i];
    res = max(res, s / (a + b * (i + 1)));
  }
  cout << res << endl;
  return 0;
}