-
Notifications
You must be signed in to change notification settings - Fork 0
/
Climbing the Leaderboard
48 lines (36 loc) · 981 Bytes
/
Climbing the Leaderboard
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'climbingLeaderboard' function below.
#
# The function is expected to return an INTEGER_ARRAY.
# The function accepts following parameters:
# 1. INTEGER_ARRAY ranked
# 2. INTEGER_ARRAY player
#
def climbingLeaderboard(ranked, player):
# Write your code here
c = list(dict.fromkeys(ranked))
b = []
j=0
player.sort(reverse=True)
for x in player:
while j<len(c) and x<c[j]:
j+=1
b.append(j+1)
b.sort(reverse=True)
return b
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
ranked_count = int(input().strip())
ranked = list(map(int, input().rstrip().split()))
player_count = int(input().strip())
player = list(map(int, input().rstrip().split()))
result = climbingLeaderboard(ranked, player)
fptr.write('\n'.join(map(str, result)))
fptr.write('\n')
fptr.close()