n, a, b, x, y = map(int, input().split())
H = list(map(int, input().split()))
import heapq

def is_ok(k):
    q = []
    for h in H:
        if h > k:
            q.append(-(h-k))
    heapq.heapify(q)
    for i in range(a):
        if q:
            v = heapq.heappop(q)
            v = -v
            if v > x:
                v -= x
                heapq.heappush(q, -v)
    if not q:
        return True
    s = 0
    while  q:
        v = heapq.heappop(q)
        v = -v
        s += v
    return  s <= y*b

ng = -1
ok = max(H)
while ng+1<ok:
    c = (ng+ok)//2
    if is_ok(c):
        ok = c
    else:
        ng = c
print(ok)