import core.stdc.stdio;
import std.algorithm;
import std.math;
import std.conv;
  
void main(){
 int n,a,b;
 scanf("%d%d%d",&n,&a,&b);
 int[] cs = new int[n];
 int kc;
 scanf("%d",&kc);
 for(int i=0;i<n;i++){
  scanf("%d",&cs[i]);
 }
 cs.sort!"a>b";
 double ans = kc.to!double/a;
 int csum = kc;
 for(int i=0;i<n;i++){
  csum+=cs[i];
  ans = max(ans,csum.to!double/(a+b*(i+1)));
 }
 printf("%d\n",ans.floor.to!int);
}