#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
    int n,a,b,c;
    cin>>n>>a>>b>>c;
    int *co;
    co=new int[n];
    for(int i=0;i<n;++i) {
        cin>>co[i];
    }
    sort(co,co+n,greater<int>());
    int nmax=0;
    nmax=c/a;
    int monny=c;
    for(int i=0;i<n;++i) {
        monny+=co[i];
        nmax=max(nmax,monny/(a+(i+1)*b));
    }
    cout<<nmax<<endl;
    return 0;
}