gistfile1.txt

def binsearch(a,q):
    l = mid = 0
    r = len(a) -1
    while l<=r:
        mid = (l+r)//2
        if a[mid] == q:
            return mid
        elif a[mid]< q:
            l = mid +1
        elif a[mid]> q:
            r = mid - 1
    return r
        
# Complete the climbingLeaderboard function below.
def climbingLeaderboard(scores, alice):
    board = []
    ranks = []
    for i in scores:
        if len(board)==0 or board[0] != i:
            board.insert(0,i)
    for i in alice:
        pos = len(board) - binsearch(board,i)
        ranks.append(pos)
    return ranks