GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — AlgorithmNuggets/ProblemSolving/interface/interface.py at master · srixivas/AlgorithmNuggets Expand file tree/ Copy pathinterface.pyMore file actions 31 lines (27 loc) · 760 Bytes / Copy pathinterface.pyFile metadata and controls31 lines (27 loc) · 760 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 self.__class__ def comparator(a, b): if a.score < b.score: return 1 elif a.score == b.score: if a.name > b.name: return 1 else: return -1 else: return -1 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 |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |