#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<int> top;
  int n, a, b, c;
  cin >> n >> a >> b >> c;
  int aa;
  for (int i = 0; i < n; i++) {
    cin >> aa;
    top.emplace_back(aa);
  }
  std::sort(top.begin(), top.end(), std::greater<int>());
  int mmax = 0, cal = 0;
  for (int i = 0; i < n; i++) {
    cal += top[i];
    mmax = max(mmax, (c + cal) / (a + (i + 1) * b));
  }
  cout << mmax << endl;
}
