Editorial for TLE '15 P1 - Power Rankings


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

A simple implementation problem. Sum all of the times, sort names by total time and output in increasing order.

Time complexity: \mathcal{O}(N \log N)


Comments

There are no comments at the moment.