I really don't know why I cant reach optimal time. It's always more than 1 sec. Here's my code:

n = int(input())
data = [[] for k in range(101)]
for i in range(n):
    ID, tasks = map(int, input().split())
    data[tasks] += [ID]
for i in range(100, -1, -1):
    for j in data[i]:
        print(j, i)

Meanwhile, I tried to reach time less that 1 sec by not using sorting but as I can see it's not working =(

Edited by author 20.08.2018 16:29