[알고리즘] 28. Climbing the Leaderboard

Alice is playing an arcade game and wants to climb to the top of the leaderboard and wants to track her ranking. The game uses Dense Ranking, so its leaderboard works like this:

• The player with the highest score is ranked number  on the leaderboard.
• Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number.

For example, the four players on the leaderboard have high scores of , , , and . Those players will have ranks , , , and , respectively. If Alice's scores are ,  and , her rankings after each game are ,  and .

Function Description

Complete the climbingLeaderboard function in the editor below. It should return an integer array where each element  represents Alice's rank after the  game.

climbingLeaderboard has the following parameter(s):

• scores: an array of integers that represent leaderboard scores
• alice: an array of integers that represent Alice's scores

Input Format

The first line contains an integer , the number of players on the leaderboard.
The next line contains  space-separated integers , the leaderboard scores in decreasing order.
The next line contains an integer, , denoting the number games Alice plays.
The last line contains  space-separated integers , the game scores.

Constraints

•  for 
•  for 
• The existing leaderboard, , is in descending order.
• Alice's scores, , are in ascending order.

Subtask

For  of the maximum score:

Output Format

Print  integers. The  integer should indicate Alice's rank after playing the  game.

Sample Input 1

CopyDownload

7
100 100 50 40 40 20 10
4
5 25 50 120

Sample Output 1

6
4
2
1

Explanation 1

Alice starts playing with  players already on the leaderboard, which looks like this:

After Alice finishes game , her score is  and her ranking is :

After Alice finishes game , her score is  and her ranking is :

After Alice finishes game , her score is  and her ranking is tied with Caroline at :

After Alice finishes game , her score is  and her ranking is :

Sample Input 2

CopyDownload

6
100 90 90 80 75 60
5
50 65 77 90 102

Sample Output 2

6
5
4
2
1



답 : 


#!/bin/python3
import math
import os
import random
import re
import sys
from collections import Counter
# Complete the climbingLeaderboard function below.
def climbingLeaderboard(scores, alice):
    scores = sorted(scores)
    scorelist = []
    total = list()
    for i,a in enumerate(alice):
        scorelist.append(dict(Counter(sorted(scores+[a],reverse=True))))
        if a in list(scorelist)[i]:
            total.append(list(scorelist[i]).index(a)+1)   
    return total
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')
    scores_count = int(input())
    scores = list(map(int, input().rstrip().split()))
    alice_count = int(input())
    alice = list(map(int, input().rstrip().split()))
    result = climbingLeaderboard(scores, alice)
    fptr.write('\n'.join(map(str, result)))
    fptr.write('\n')
    fptr.close()

중복되는 순위에는 동일한 순위를 부여하고, 새로 들어온 요소의 순위를 찾는 문제!

어떤 원리로 찾는지는 알겠는데 4개의 문제는 숫자가 200,000개 이상이 되니 runtime error가 발생한다..... 코드를 좀 더 최적화 하기 위해 다시 도전해봐야겠다..