Submit | All submissions | Best solutions | Back to list |
EIBEST - Best students |
Now, you are given the grades of courses of N students and your task is to compute and print out all students that had the best GPA. Remember that courses with grades smaller than 50 are not counted.
Input
The first line contains one positive integer N (N ≤ 105) – the number of students.
2*N next lines contains the information of N students with the following format:
- The first line contains a string S (1 ≤ |S| ≤ 20) and a positive integer K (K ≤ 100) – the name of the student and the number of courses that the student registered.
- The second line contains K integers – the grade of K courses.
Output
For each student that has the highest GPA among N students, print out the name and the GPA (rounded to nearest integer).
Sample
Input |
Output |
4 Khanh 4 80 80 90 90 Duong 4 70 70 80 80 Cuong 4 85 85 85 85 An 5 50 60 70 80 100 |
Khanh 85 Cuong 85
|
Added by: | Ha Minh Ngoc |
Date: | 2019-11-04 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: GOSU |