#include <iostream>
#include <algorithm>
using namespace std;
int main(){
  int n;
  double pp,tp;
  double pcal,tcal[1000];
  cin >> n;
  cin >> pp >> tp;
  cin >> pcal;
  for(int i = 0 ; i < n ; i++ ){
    cin >> tcal[i];
  }

  sort(tcal,tcal + n , greater<int>());

  double mx = pcal/pp;
  double sumcal = pcal;
  for(int i = 0 ; i < n ; i++){
    if(mx < sumcal/(pp + tp*i) ) mx = sumcal/(pp + tp*i);
    sumcal += tcal[i];
  }

  cout << (int)mx << endl;
  return 0;
}