#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    ll n,a,b,x,y;
    cin >> n >> a >> b >> x >> y;
    priority_queue<ll> h;
    rep(i,n){
        ll z;
        cin >> z;
        h.push(z);
    }
    rep(i,a){
        h.push(h.top()-x);
        h.pop();
    }
    ll be = -1, en = 1000000001;
    while(en-be!=1){
        ll md = (be+en)/2;
        priority_queue<ll> h2 = h;
        ll tot = 0;
        while(h2.size()){
            tot += max(0LL, h2.top()-md);
            h2.pop();
        }
        if(tot<=b*y) en = md;
        else be = md;
    }
    cout << en << endl;
    return 0;
}