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

int main(){
  int n,a,b,c,i,max,p,q;
  cin >> n >> a >> b >> c;
  int h[n];
  i = n;
  while(i--)
    cin >> h[i];
  sort(h,h+n);
  p=a;
  q=c;
  max = floor(q/p);
  for(i=0; i<n; i++){
    p=a+(i+1)*b;
    q+=h[n-i-1];
    if(max>floor(q/p))
      break;
    else
      max = floor(q/p);
  }
  cout << max << endl;
  return 0;
}