#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >>n;
int a;
cin >>a;
int b;
cin >>b;
int c;
cin >>c;
int d[n];
int e;
e=0;
while(e<n){
cin>>d[e];
e=e+1;}
sort(d,d+n);
int f;
f=c/a;
int g;
e=n-1;
while(e>=0){
c=c+d[e];
a=a+b;
g=c/a;
if(g<f){break;}
if(g>f){f=g;}
e=e-1;}
cout <<f<<endl;}