SOLVE

LATER

Rank List

Problem

Editorial

Analytics

Mid sem marks of a particular subject is announced , since you are curious in knowing your position in class so you decided to make a rank list . You are given the name , scholoar number and marks of every student in your class. You have to come up with accurate rank list i.e student having maximum marks at the top and if two students are having same marks then the student having lexicographically smaller name comes first , if both name and marks of the student collide then student having smaller scholar number comes first.

**Input:**

First line of input contains N - Total number of students in class

Next N line contains name of student , scholar number and marks scored in exam .

**Output:**

Print the ranklist of students as explained above.

**Constraints**

1 <= N <= 1000

1 <= length of name <= 10

1 <= scholar number <= 1000

0 <= marks <= 30

Problem Setter : Satyam Swarnkar

Time Limit:
1.0 sec(s)
for each input file.

Memory Limit:
256 MB

Source Limit:
1024 KB

Marking Scheme:
Marks are awarded when all the testcases pass.

Allowed Languages:
C,
C++,
C++14,
Clojure,
C#,
D,
Erlang,
F#,
Go,
Groovy,
Haskell,
Java,
Java 8,
JavaScript(Rhino),
JavaScript(Node.js),
Julia,
Lisp,
Lisp (SBCL),
Lua,
Objective-C,
OCaml,
Octave,
Pascal,
Perl,
PHP,
Python,
Python 3,
R(RScript),
Racket,
Ruby,
Rust,
Scala,
Swift,
Visual Basic,
Kotlin

Initializing Code Editor...

{"f386583": "/pagelets/suggested-problems/algorithm/rank-list/", "f3865af": "/pagelets/problems-hint/algorithm/rank-list/", "f386561": "/pagelets/show-submission/algorithm/rank-list/", "f38659a": "/pagelets/problem-author-tester/algorithm/rank-list/", "f3865c4": "/pagelets/recommended-problems/algorithm/rank-list/"}

{}

realtime.hackerearth.com

80

013cfe62e0473113d10128029ff240745d53a970

58a29e5cae2309f04b28

/realtime/pusher/auth/