We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Climbing the Leaderboard
  5. Discussions

Climbing the Leaderboard

  • AffineStructure
     + 8 comments

    Here is my Python 3 solution using the bisect library.

    from bisect import bisect_right

n = int(input())
scores = sorted(set(map(int,input().split())))
m = int(input())
alice = map(int,input().split())

# your code goes here
for i in alice:
    print(len(scores)-bisect_right(scores,i)+1)