Nested List | HackerRank | Find the second last element in the nested list

#hackerrank #nested_list_using_python
Given the names and grades for each student in a Physics class of N 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 less than or equal to N less than or equal to 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 0
5
Harry
37.21
Berry
37.21
Tina
37.2
Akriti
41
Harsh
39
Sample Output 0

Berry
Harry
Explanation 0

There are 5 students in this class whose names and grades are assembled to build the following list:

python students = [['Harry', 37.21], ['Berry', 37.21], ['Tina', 37.2], ['Akriti', 41], ['Harsh', 39]]

The lowest grade of 37.2 belongs to Tina. The second lowest 37.21 grade of belongs to both Harry and Berry, so we order their names alphabetically and print each name on a new line.

[UltimateGamer-easycodesol]

N=int(input())
ml=[]
for i in range(N):
el=[]
el.append((input()))
no=float(input())

el.append(no)
ml.append(el)

nl=[]
for i in range (N):
nl.append(ml[i][1])
nnl=sorted(nl)

mino=nnl[0]
for i in range(N):
if nnl[i]>mino:
op=nnl[i]
break

fl=[]
for i in range(N):
for j in range(2):
if ml[i][1]==op:
fl.append(ml[i][0])
break
fl.sort()
for i in fl:
print(i)