N = input()
A, B = map(int, raw_input().split())
C = input()
D = [input() for i in range(N)]
D.sort(reverse=True)
best = 0
for i in range(N):
    topping = D[:i]
    k = len(topping)
    price = A + B * k
    calory = C + sum(topping)
    best = max(best, calory / price)
print best