local mfl, mce = math.floor, math.ceil
local n, a, b = io.read("*n", "*n", "*n")
local c = a - b
local h = {}
for i = 1, n do
  h[i] = io.read("*n")
end
table.sort(h)

local function solve(x)
  local cnt = 0
  for i = 1, n do
    if x * b < h[i] then
      cnt = cnt + mce((h[i] - x * b) / c)
    end
  end
  return cnt <= x
end

local min = 0
local max = mce(h[n] / b)
while 1 < max - min do
  local mid = mfl((min + max) / 2)
  if solve(mid) then
    max = mid
  else
    min = mid
  end
end
print(max)
