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
def solution(N, stages):

    a = [0]*(N+1)
    b = [0]*(N+1)

    for k in stages:
        if 1<=k<=N:
            a[k] += 1
            for i in range(1, k+1):
                b[i] += 1
        else:
            for j in range(1, len(b)):
                b[j] += 1

    pre = []
    for n in range(1, N+1):
        pre.append([a[n]/b[n], n])

    pre.sort(key=lambda x: (-x[0], x[1]))

    answer = []
    for p in pre:
        answer.append(p[1])

    return answer