Maximum Total Score in a Ranking System
Combinatorics · IMO Shortlist 2024
Let $n$ be a positive integer. A class of $n$ students run $n$ races, in each of which they are ranked with no draws. A student is eligible for a rating $(a, b)$ for positive integers $a$ and $b$ if they come in the top $b$ places in at least $a$ of the races. Their final score is the maximum possible value of $a-b$ across all ratings for which they are eligible.
If $n=200$, find the maximum possible sum of all the scores of all the students.