forked from minaevd/hackerrank-tasks
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsorting_comparator.py
More file actions
33 lines (24 loc) · 811 Bytes
/
Copy pathsorting_comparator.py
File metadata and controls
33 lines (24 loc) · 811 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
# Enter your code here. Read input from STDIN. Print output to STDOUT
class Player:
def __init__(self, name, score):
self.name = name
self.score = score
def __repr__(self):
return repr((self.name, self.score))
def comparator(a, b):
if (a.name < b.name):
return (b.score - a.score) * 10000 - 1 # 10000 is just some large value to account for -1 (or +1) added
elif (a.name > b.name):
return (b.score - a.score) * 10000 + 1
else:
return b.score - a.score
n = int(raw_input())
data = []
for i in range(n):
name, score = raw_input().split()
score = int(score)
player = Player(name, score)
data.append(player)
data = sorted(data, cmp=Player.comparator)
for i in data:
print i.name, i.score