from heapq import *

n, a, b, x, y = map(int, input().split())
h = list(map(int, input().split()))
def ok(X):
	h2 = [min(0, X - h[i]) for i in range(n)]
	heapify(h2)
	for i in range(a):
		ma = min(0, heappop(h2) + x)
		heappush(h2, ma)
	return True if sum(h2) * -1 <= b * y else False
l, r = -1, 10 ** 9
while r - l > 1:
	m = (l + r) // 2
	if ok(m): r = m
	else: l = m
print(r)