#include<stdio.h>
#include<algorithm>
using namespace std;
int t[100];

int max(int a,int b){return a>b?a:b;}

int main(){
	int n,a,b,c;
	int i,j;
	scanf("%d",&n);
	scanf("%d %d",&a,&b);
	scanf("%d",&c);
	for(i=0;i<n;i++)scanf("%d",&t[i]);
	sort(t,t+n);
	reverse(t,t+n);
	int ans=0;
	for(i=0;i<=n;i++){
		int cal=c;
		int p=a+b*i;
		for(j=0;j<i;j++)cal+=t[j];
		ans=max(ans,cal/p);
	}
	printf("%d\n",ans);
	return 0;
}