#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  double ans = 0;
  vector<int> cal;
  int top;
  int kizi;
  int doru;
  int top_cnt = 1;
  int true_value;
  cin >> n;
  cin >> doru;
  cin >> top;
  ans = doru / top;
  cin >> kizi;
  true_value = kizi;
  for (int i = 0; i < n; i++) {
    int now_top;
    cin >> now_top;
    cal.push_back(now_top);
  }
  sort(cal.begin(), cal.end());
  reverse(cal.begin(), cal.end());
  for (int i = 0; i < cal.size(); i++) {
    true_value += cal[i];
    double value = (double)true_value / (doru + top * top_cnt);
    if (ans >= value) {
      break;
    }
    ans = value;
    top_cnt++;
  }
  cout << (int)ans << endl;
  return 0;
}
