-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNested Lists
More file actions
63 lines (49 loc) · 1.36 KB
/
Nested Lists
File metadata and controls
63 lines (49 loc) · 1.36 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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
Problem :
Given the names and grades for each student in a class of students, N.
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 second lowest 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 subsequent lines describe each student over lines.
- The first line contains a student's name.
- 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. 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
Solution
scores = []
grades = []
n = int(input())
for i in range(n):
name = input()
score = float(input())
grades.append([name,score])
scores.append(score)
scores.sort()
second_min = 0
minimum = scores[0]
grades.sort()
for i in scores:
if i != minimum:
second_min = i
break
for i in grades:
if i[1] == second_min:
print(i[0])