#include <bits/stdc++.h>
using namespace std;
int main() {
  int Ans = 1000000000;
  int n, kizi, top, kizi_cl;
  int top_cl[10000];
  for (int i = 0; i < 10000; i++) top_cl[i] = 0;
  cin >> n;
  cin >> kizi >> top;
  cin >> kizi_cl;
  for (int i = 0; i < n; i++) {
    cin >> top_cl[i];
  }
  sort(top_cl, top_cl + 10000);
  int count = 9999;
  int a_1, a_2;
  a_1 = kizi;
  a_2 = kizi_cl;
  Ans = kizi_cl / kizi;
  while (true) {
    a_2 += top_cl[count];
    a_1 += top;
    if (Ans < (a_2 / a_1))
      Ans = (a_2 / a_1);
    else
      break;
    count--;
    if (count == -1) break;
  }
  cout << Ans << endl;
}
