-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhr_nestedlists.py
31 lines (30 loc) · 973 Bytes
/
hr_nestedlists.py
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
#d=[["Harsh",20],["Beria",20],["Varun",19],["Kakunami",19],["Vikas",21]]
#d=[["Harry",37.21],["Berry",37.21],["Tina",37.2],["Akriti",41],["Harsh",39]]
d=[["Rachel",-50],["Mawer",-50],["Sheen",-50],["Shaheen",-50]]
#finding all the names of people having second last value in d
for j in range(len(d)):
for i in range(len(d)-j-1):
if(d[i][1]>d[i+1][1]):
d[i],d[i+1]=d[i+1],d[i]
elif(d[i][1]==d[i+1][1]):
if(d[i][0]>d[i+1][0]):
if(d[i][0]>d[i+1][0]):
d[i+1],d[i]=d[i],d[i+1]
print(d)
d.append([0,0])
d.append([0,0])
d.append([0,0])
print(d)
a=[]
for i in range(len(d)-2):
if(d[i][1]<d[i+1][1]):
if(d[i+1][1]<d[i+2][1]):
a.append(d[i+1])
break
else:
for j in range(i+1,len(d)):
if(d[j][1]==d[i+1][1]):
a.append(d[j])
break
for i in range(len(a)):
print(a[i][0])