#include <iostream>
#include <algorithm>
#include <functional>
#include <cmath>

using namespace std;

int top[100];

int main(){
    int n,a,b,c;
    cin>>n>>a>>b>>c;
    double cl=c,pr=a;
    for(int i=0;i<n;++i) cin>>top[i];
    sort(top,top+n,greater<int>());
    for(int i=0;i<n;++i){
        if(cl*b>top[i]*pr) break;
        cl +=top[i];pr +=b;
    }
    cout<<floor(cl/pr)<<endl;
    return 0;
}