#include <bits/stdc++.h>
using namespace std;
int main(){
    int N,A,X,Y,index=0,input;
    long long ans,B;
    cin>>N>>A>>B>>X>>Y;
    long long diff[N];
    B*=Y;
    priority_queue<int> q;
    for(int i=0;i<N;++i){
        cin>>input;
        q.push(input);
    }
    for(int i=0;i<A;++i){
        q.push(max(0,q.top()-X));
        q.pop();
    }
    for(int i=N-1;i>=0;--i){
        diff[i]=q.top();
        q.pop();
    }
    ans=diff[N-1];
    for(int i=N-1;i>=1;--i){
        diff[i]-=diff[i-1];
    }
    for(int i=N-1;i>=0;--i){
        if(diff[i]*(N-i)>=B){
            cout<<(ans-B/(N-i))<<endl;
            return 0;
        }else{
            ans-=diff[i];
            B-=diff[i]*(N-i);
        }
    }
}