Çàäà÷à . Áèíàðíûé ïîèñê â íåâîçðàñòàþùåì ìàññèâå - 4.1

def binSearch(A, key):          

    l =          

    r =           

    while l + 1 < r:          

        m = (r + l) // 2          

        if A[m] >= key:          

        else:          

    if  :          

    if  :          

    return -1          

A = list(map(int, input().split()))          

A.sort(reverse=True)          

key = int(input())          

ind = binSearch(A, key)          

print(ind)