#include<iostream>
#include<algorithm>
using namespace std;
int N,A,B,X,Y;
int Hi[1<<17];
int H[1<<17];
bool check(int K)
{
	int a=A;
	long all=(long)Y*B;
	for(int i=0;i<N;i++)
	{
		H[i]=Hi[i]-K;
		if(H[i]<0)H[i]=0;
		while(a>0&&H[i]>=X)H[i]-=X,a--;
		all-=H[i];
	}
	sort(H,H+N);
	for(int i=0;i<a&&i<N;i++)all+=H[N-i-1];
	return all>=0;
}
main()
{
	cin>>N>>A>>B>>X>>Y;
	for(int i=0;i<N;i++)cin>>Hi[i];
	int L=-1,R=1e9;
	while(R-L>1)
	{
		int mid=(L+R)/2;
		if(check(mid))R=mid;
		else L=mid;
	}
	cout<<R<<endl;
}