Envío 1478

Código

n = int(input())
arr = sorted(list(map(int, input().split(" "))))

def binary_search(arr, low, high, x):
    if high > low:
        mid = (high + low) // 2
        if arr[mid] == x: 
            return mid
        elif arr[mid] > x:
            return binary_search(arr, low, mid - 1, x)
        else:
            return binary_search(arr, mid + 1, high, x) 
    else:
        return -1

c = int(input())

for i in range(0, c):
    x = int(input())
    index = binary_search(arr, 0, n, x)
    if index == -1:
        print(n)
    else:
        for j in range(index, n):
            if arr[j] > x:
                break
            index = j
        print(n - index - 1)