Hackerrank-Python-Solutions/10. Nested Lists.py at main · Developer-Rakeen/Hackerrank-Python-Solutions · GitHub

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
N = int(input())

lst = []

nest_lst = []

find_min_lst = []

for i in range(N):
    temp1 = input()
    temp2 = input()
    find_min_lst.append(float(temp2))
    nest_lst.append(temp1)
    nest_lst.append(float(temp2))
    lst.append(nest_lst)
    nest_lst = []


minimum = min(find_min_lst)
result = max(find_min_lst)
temp = max(find_min_lst)


for i in range(len(lst)):
    if lst[i][1] < result and lst[i][1] > minimum:
        result = lst[i][1]


prnt_lst = []

for i in range(len(lst)):
    if lst[i][1] == result:
        prnt_lst.append(lst[i][0])


prnt_lst.sort()

for prnt in prnt_lst:
    print(prnt)