FPC20-009.Ducks and Sharks

• One line with one integer: $2 \leq n \leq 400$, the number of teams.

• $\frac{n \cdot (n - 1)}2$ lines (one for each match), containing the names of the two teams and the number of goals both teams made during that match (all separated by one space).

• The name of each team consists of at most 20 characters from the English alphabet (A-Z and a-z).

• The scores are between $0$ and $100$ (inclusive).

Note that every team plays exactly once against every other team.

The names of the top five teams in the water polo competition, followed by their total obtained score. Each team name should be written on a separate line. Each team name and score should be separated by exactly one space. Note:

• If there are less than five teams participating, simply list all participants (see example 1).

• If there are two teams with the same score, order them alphabetically (see example 2).

Source: Freshmen Programming Contest 2020 · License: CC BY-SA 4.0 · Original: https://fpc.wisv.ch · Statement adapted for AlgoLens and shared under the same license. · 1 of the 12 original test cases (the largest) are omitted here to keep the problem lightweight.