Is there a way to solve this problem with complexity O(N), not O(N*M)? The first way always gets MLE: you need to store list of teams in dynamic array [1..100] which is obviously TLE. Grouping teams in buckets (so using only 1 pointer for ~400 teams) don't help either.

And what is your solution for this problem?



Edited by author 25.10.2004 20:19

Count sort + I stored scores and IDs in one longint (8 + 24 bits).