ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1100. Final Standings

TLE №11. Python 3.4
Posted by Darkness 20 Aug 2018 16:27
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