import numpy as np



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

l = []



for i in range(n):

	l.append(eval(input()))

ll = np.array(l)

ll.sort()

ll = ll[::-1]



# print count

def solve(count):

	q = ll - b * count

	t = q > 0



	if a > b:

		p = (q - 1) / (a - b) + 1

	else:

		p = q

	p = p[p > 0]

	if p.sum() <= count:

		return True

	else:

		return False



l = 1

r = ll[0] / b + 1

while r - l > 1:

	m = (l + r) / 2

	if solve(m):

		r = m

	else:

		l = m



if r == 2:

	if solve(1):

		r = 1



print(r)


import numpy as np



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

l = []



for i in range(n):

	l.append(eval(input()))

ll = np.array(l)

ll.sort()

ll = ll[::-1]



def solve(hp, count):

	q = hp - b * count

	t = q > 0



	if a > b:

		p = (q - 1) / (a - b) + 1

	else:

		p = q

	p = p[p > 0]

	if p.sum() <= count:

		return True

	else:

		return False



l = 1

r = ll[0] / b + 1

while r - l > 1:

	m = (l + r) / 2

	if solve(ll, m):

		r = m

	else:

		l = m



if r == 2:

	if solve(ll, 1):

		r = 1



print(r)
import numpy as np

n, a, b = list(map(int, input().split()))
l = []
for i in range(n):
    l.append(eval(input()))
ll = np.array(l)
ll.sort()
ll = ll[::-1]
# print count
def solve(count):
    q = ll - b * count
    t = q > 0
    if a > b:
        p = (q - 1) / (a - b) + 1
    else:
        p = q
    p = p[p > 0]
    if p.sum() <= count:
        return True
    else:
        return False


l = 1
r = ll[0] / b + 1
while r - l > 1:
    m = (l + r) / 2
    if solve(m):
        r = m
    else:
        l = m
if r == 2:
    if solve(1):
        r = 1
print(r)

import numpy as np

n, a, b = list(map(int, input().split()))
l = []
for i in range(n):
    l.append(eval(input()))
ll = np.array(l)
ll.sort()
ll = ll[::-1]


def solve(hp, count):
    q = hp - b * count
    t = q > 0
    if a > b:
        p = (q - 1) / (a - b) + 1
    else:
        p = q
    p = p[p > 0]
    if p.sum() <= count:
        return True
    else:
        return False


l = 1
r = ll[0] / b + 1
while r - l > 1:
    m = (l + r) / 2
    if solve(ll, m):
        r = m
    else:
        l = m
if r == 2:
    if solve(ll, 1):
        r = 1
print(r)

-# print count -def solve(count): -    q = ll - b * count + + +def solve(hp, count): +    q = hp - b * count -    if solve(m): +    if solve(ll, m): -    if solve(1): +    if solve(ll, 1):