import java.io.*;
import java.util.*;

class Main
{
    public static void main(String args[])throws Exception
    {
        BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb=new StringBuilder();
        String s[]=bu.readLine().split(" ");
        int n=Integer.parseInt(s[0]),a=Integer.parseInt(s[1]),b=Integer.parseInt(s[2]),x=Integer.parseInt(s[3]),y=Integer.parseInt(s[4]);
        int i,h[]=new int[n];
        s=bu.readLine().split(" ");
        for(i=0;i<n;i++) h[i]=Integer.parseInt(s[i]);

        int l=0,r=(int)1e9,mid,ans=r;
        while(l<=r)
        {
            mid=(l+r)>>1;
            if(possible(h,a,b,x,y,mid))
            {
                ans=mid;
                r=mid-1;
            }
            else l=mid+1;
        }
        System.out.println(ans);
    }

    static boolean possible(int en[],int a,int b,int x,int y,int k)
    {
        int i,n=en.length,h[]=new int[n];
        for(i=0;i<n;i++) h[i]=en[i]-k;

        PriorityQueue<int[]> pq=new PriorityQueue<>(new Comparator<int[]>() {
            @Override
            public int compare(int[] o1, int[] o2) {
                if(o1[0]<o2[0]) return 1;
                else if(o1[0]==o2[0]) return o1[1]>o2[1]?1:-1;
                else return -1;
            }});
        for(i=0;i<n;i++)
        if(h[i]>0) pq.add(new int[]{h[i],i});

        while(a-->0 && !pq.isEmpty())
        {
            int e[]=pq.poll();
            e[0]-=x;
            h[e[1]]-=x;
            if(e[0]>0) pq.add(e);
        }

        long del=1l*b*y;
        for(i=0;i<n;i++)
        {
            long t=Math.max(0,Math.min(h[i],del));
            h[i]-=t;
            del-=t;
            if(h[i]>0) return false;
        }
        return true;
    }
}