import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline

def main():
    n,a,b,x,y = map(int,input().split())
    H = list(map(int,input().split()))

    if solve(n,a,b,x,y,H,0):
        print(0);exit()

    ok = pow(10,9)
    ng = 0
    while abs(ok-ng) > 1:
        mid = (ok+ng)//2
        if solve(n,a,b,x,y,H,mid):
            ok = mid
        else:
            ng = mid
    print(ok)


def solve(n,a,b,x,y,H,geta):
    H = [max(0, h - geta) for h in H] #最初引いて0未満のものは0とする。
    #つかるやつは順番に
    for i in range(n):
        num = H[i]//x
        if a > num:
            a -= num
            H[i] -= num*x
        else:
            H[i] -= a*x
            a = 0
            break
    
    #print(H)
    #マイナスが小さい順、つまり大きい順
    H.sort(reverse=True)
    #print(H)
    for i in range(n):
        if a == 0: break
        H[i] -= x
        a -= 1
    #print(H)

    #正の部分だけ
    total = 0
    for i in range(n):
        if H[i] > 0:
            total += H[i]
    if total <= b*y:
        return True
    else:
        return False


if __name__ == '__main__':
    main()