Given a dictionary of player names to scores, return the top n players as [name, score] pairs,
highest score first. Break ties alphabetically by name. If there are fewer than n players, return all.
Implement top_n. Input: scores: dict[str, int], n: int. Returns: list[[str, int]].
def top_n(scores: dict[str, int], n: int) -> list[list]:
return []
Run executes the public tests. Submit grades against public and hidden tests.
Given a dictionary of player names to scores, return the top n players as [name, score] pairs,
highest score first. Break ties alphabetically by name. If there are fewer than n players, return all.
Implement top_n. Input: scores: dict[str, int], n: int. Returns: list[[str, int]].
def top_n(scores: dict[str, int], n: int) -> list[list]:
return []
Run executes the public tests. Submit grades against public and hidden tests.