n,a,b=list(map(int,input().split()))

h=[int(input()) for _ in range(n)]

l=0

r=10**12

while r-l>1:

    m=(r+l)/2

    c=a-b

    cnt=0

    for i in range(n):

        if h[i]-b*m<0:continue

        if (h[i]-b*m)%c==0:

            cnt+=(h[i]-b*m)/c

        else:

            cnt+=(h[i]-b*m)/c+1

    if cnt<=m:

        r=m

    else:

        l=m

print(r)

def min_bs(l,r):

    l-=1

    while r-l>1:

        m=(r+l)/2

        if check(m):

            r=m

        else:

            l=m

    return r



def check(m):

    cnt=0

    for i in range(n):

        if h[i]-b*m<=0:continue

        cnt+=(h[i]-b*m-1)/(a-b)+1

    return True if m>=cnt else False



n,a,b=list(map(int,input().split()))

h=[int(input()) for _ in range(n)]

print(min_bs(1,10**9))
n, a, b = list(map(int, input().split()))
h = [int(input()) for _ in range(n)]
l = 0
r = 10**12
while r - l > 1:
    m = (r + l) / 2
    c = a - b
    cnt = 0
    for i in range(n):
        if h[i] - b * m < 0:
            continue
        if (h[i] - b * m) % c == 0:
            cnt += (h[i] - b * m) / c
        else:
            cnt += (h[i] - b * m) / c + 1
    if cnt <= m:
        r = m
    else:
        l = m
print(r)

def min_bs(l, r):
    l -= 1
    while r - l > 1:
        m = (r + l) / 2
        if check(m):
            r = m
        else:
            l = m
    return r


def check(m):
    cnt = 0
    for i in range(n):
        if h[i] - b * m <= 0:
            continue
        cnt += (h[i] - b * m - 1) / (a - b) + 1
    return True if m >= cnt else False


n, a, b = list(map(int, input().split()))
h = [int(input()) for _ in range(n)]
print(min_bs(1, 10**9))

+def min_bs(l, r): +    l -= 1 +    while r - l > 1: +        m = (r + l) / 2 +        if check(m): +            r = m +        else: +            l = m +    return r + + +def check(m): +    cnt = 0 +    for i in range(n): +        if h[i] - b * m <= 0: +            continue +        cnt += (h[i] - b * m - 1) / (a - b) + 1 +    return True if m >= cnt else False + + -l = 0 -r = 10**12 -while r - l > 1: -    m = (r + l) / 2 -    c = a - b -    cnt = 0 -    for i in range(n): -        if h[i] - b * m < 0: -            continue -        if (h[i] - b * m) % c == 0: -            cnt += (h[i] - b * m) / c -        else: -            cnt += (h[i] - b * m) / c + 1 -    if cnt <= m: -        r = m -    else: -        l = m -print(r) +print(min_bs(1, 10**9))