#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, A, B, X, Y;
  cin >> N >> A >> B >> X >> Y;
  vector<int> H(N);
  for (int i = 0; i < N; i++){
    cin >> H[i];
  }
  int tv = 1000000000, fv = -1;
  while (tv - fv > 1){
    int mid = (tv + fv) / 2;
    priority_queue<int> pq;
    for (int i = 0; i < N; i++){
      if (H[i] > mid){
        pq.push(H[i] - mid);
      }
    }
    for (int i = 0; i < A; i++){
      if (!pq.empty()){
        int x = pq.top();
        pq.pop();
        if (x > X){
          pq.push(x - X);
        }
      }
    }
    long long sum = 0;
    while (!pq.empty()){
      sum += pq.top();
      pq.pop();
    }
    if (sum <= (long long) B * Y){
      tv = mid;
    } else {
      fv = mid;
    }
  }
  cout << tv << endl;
}