-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathnested_list.py
More file actions
42 lines (34 loc) · 1.24 KB
/
nested_list.py
File metadata and controls
42 lines (34 loc) · 1.24 KB
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
32
33
34
35
36
37
38
39
40
41
42
# Given the names and grades for each student in a Physics class of students,
# store them in a nested list and print the name(s) of any student(s) having the second lowest grade.
# Note: If there are multiple students with the same grade, order their names alphabetically and print each name on a new line.
# Input Format
# The first line contains an integer, N , the number of students.
# The 2N subsequent lines describe each student over 2 lines; the first line contains a student's name,
# and the second line contains their grade.
# Constraints
# 2 <= N <= 5
# There will always be one or more students having the second lowest grade.
# Output Format
# Print the name(s) of any student(s) having the second lowest grade in Physics;
# if there are multiple students, order their names alphabetically and print each one on a new line.
# Sample Input
# 5
# Harry
# 37.21
# Berry
# 37.21
# Tina
# 37.2
# Akriti
# 41
# Harsh
# 39
# Sample Output
# Berry
# Harry
if __name__ == '__main__':
n = int(input())
marksheet = [[input(),float(input())] for _ in range(n)]
if n>=2 and n<=5:
second_largest = sorted(set([marks for name, marks in marksheet]))[1]
print('\n'.join([a for a,b in sorted(marksheet) if b == second_largest]))