Design A Leaderboard Python Solution

lcpy gen -n 1244   # by problem number
lcpy gen -s design_a_leaderboard   # by problem name

Input:
["Leaderboard","addScore","addScore","addScore","addScore","addScore","top","reset","reset","addScore","top"]
[[],[1,73],[2,56],[3,39],[4,51],[5,4],[1],[1],[2],[2,51],[3]]
Output:
[null,null,null,null,null,null,73,null,null,null,141]

Explanation
Leaderboard leaderboard = new Leaderboard();
leaderboard.addScore(1,73);   // leaderboard = [[1,73]];
leaderboard.addScore(2,56);   // leaderboard = [[1,73],[2,56]];
leaderboard.addScore(3,39);   // leaderboard = [[1,73],[2,56],[3,39]];
leaderboard.addScore(4,51);   // leaderboard = [[1,73],[2,56],[3,39],[4,51]];
leaderboard.addScore(5,4);    // leaderboard = [[1,73],[2,56],[3,39],[4,51],[5,4]];
leaderboard.top(1);           // returns 73;
leaderboard.reset(1);         // leaderboard = [[2,56],[3,39],[4,51],[5,4]];
leaderboard.reset(2);         // leaderboard = [[3,39],[4,51],[5,4]];
leaderboard.addScore(2,51);   // leaderboard = [[2,51],[3,39],[4,51],[5,4]];
leaderboard.top(3);           // returns 141 = 51 + 51 + 39;

import heapq


class Leaderboard:
    # Time: add_score O(1), top O(n log k), reset O(1)
    # Space: O(n) where n is the number of players on the leaderboard
    def __init__(self) -> None:
        self.scores: dict[int, int] = {}

    # Time: O(1)
    # Space: O(1)
    def add_score(self, player_id: int, score: int) -> None:
        self.scores[player_id] = self.scores.get(player_id, 0) + score

    # Time: O(n log k)
    # Space: O(k)
    def top(self, k: int) -> int:
        return sum(heapq.nlargest(k, self.scores.values()))

    # Time: O(1)
    # Space: O(1)
    def reset(self, player_id: int) -> None:
        del self.scores[player_id]