ボクサーのソート

1.問題リンク

2.解題コード&説明

def solution(wei, h2h):
    l = len(wei)
    win = [0]*l
    w2H = [0]*l
    for i in range(l) :
        # 승률에 대해서
        total = h2h[i].count("W") + h2h[i].count("L")
        win[i] = h2h[i].count("W")/total if total else 0
        
        # 무거운사람 이긴 횟수
        for j in range(l) :
            if wei[i] < wei[j] and h2h[i][j] == "W" :
                w2H[i] += 1

    dicts = []
    for i in range(l) :
        dicts.append({"index": i, "weight" : wei[i], "win" : win[i], "win_heavy" :w2H[i]})

    dicts.sort(key= lambda x : (-x["win"], -x["win_heavy"], -x["weight"]))
    
    
    return [x["index"]+1 for x in dicts]

3. TIL

4. TMI