Find the Toppers

CodeChefOpen on judge ↗

There are $N$ students in the class with distinct names. You are given a list of students and their scores. Your task is to find the students with maximum score and print his/her name. If there is tie, print all the names in ascending alphabetical order. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains the following - $N$, the

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI