#include <iostream>
#include <algorithm>
using namespace std;

int main() {
  int n, a, b, x, c[100];
  double max=0;
  cin >> n;
  cin >> a >> b;
  cin >> x;
  for(int i=0; i<n; i++) cin >> c[i];
  max=(double)x;
  int k=0,q=a;
  sort(c, c+n, greater<int>());
  while(k<n) {
    int p=q;
    double z=max;
    z+=c[k];
    p+=b;
    if((double)z/p > (double)max/q) {
      max = z;
      q=p;
    } else {
      z-=c[k];
      p-=b;
    }
    k++;
  }
  cout << (int)max/q << endl;
  return 0;
}
