/Python/How to find the lowest value in a nested list python

How to find the lowest value in a nested list python

if __name__ == '__main__':
arr = []
for _ in range(int(input())):
    name = input()
    score = float(input())
    arr1 = [name, score]
    arr.append(arr1)
arr.sort(key=lambda x: x[1])
# print(arr)
# print(min(arr,key=lambda x:x[1]))
arr.remove(min(arr,key=lambda x:x[1]))
# print(arr)
minimum = min(arr,key=lambda x:x[1])
# print(minimum[1])
a=[]
minimum = minimum[1]
for i  in arr:
    if(i[1] == minimum):
        a.append(i[0])
a.sort()
for i in a:
    print(i)

Similar codes

-1 vote148 views1 answer
Groupby where only
Python
1 vote289 views1 answer
Colon in array python
Python
-1 vote151 views1 answer
Python - how many letters are capital in a string
Python
0 vote147 views1 answer
Pathlib check is file
Python
2 votes159 views1 answer
Leanware forums
Python
0 vote134 views1 answer
How to add find the smallest int n in a list python
Python
0 vote185 views1 answer
First and last upper
Python
0 vote131 views1 answer
Python mixins
Python
0 vote154 views1 answer
300 x 250 donut download
Python
0 vote154 views1 answer
Sum first 100 integers in python
Python