Envío 3601

Código

def binary_search(array, element):
    lo = 0
    hi = len(array) - 1
    while lo <= hi:
        mid = lo + (hi - lo) // 2
        if element < array[mid]:
            hi = mid - 1
        elif element > array[mid]:
            lo = mid + 1
        else:
            return mid
    return -1


def count_elements_greather_than_x(array, queries):
    array.sort()
    for x in queries:
        x_index = binary_search(array, x)
        if queries != -1:
            print(len(array) - x_index - 1)
        else:
            if x < array[0]:
                print(len(array))
            else:
                print(0)


array_size = int(input())
array = [int(x) for x in input().split()]
number_of_queries = int(input())
queries = [0 for _ in range(number_of_queries)]

for i in range(number_of_queries):
    queries[i] = int(input())

count_elements_greather_than_x(array, queries)