Envío 7097

Código

def binary_search(arr, low, high, x):
    if high > low:
        mid = (high + low) // 2

        if arr[mid] > x:
            return binary_search(arr, low, mid - 1, x)
        else:
            return binary_search(arr, mid + 1, high, x)
    elif high == low:
    	if arr[len(arr) - 1] >= x:
            return high
    	else:
        # Element is not present in the array
            return len(arr)
    else:
        # Element is not present in the array
        return low

#Function call
n = int(input())
elementsArray = [int(item) for item in input().split()]
c = int(input())
querysArray = []
for i in range(0, c):
    querysArray.append(int(input()))

resultArray = [0] * c
for i in range(0, c):
    resultArray[i] = binary_search(elementsArray, 0, len(elementsArray)-1, querysArray[i])
 
for i in resultArray:
    print(i)