嵌套列表黑客排名测试用例python

Question

以下是我的 hackerrank 嵌套列表问题代码，用于打印学生倒数第二名的姓名。我开始了我的 Python 探索之旅。这段代码在下面列出的两个测试用例中失败了……任何人都可以帮我解决这个问题。

4 索娜 -25.001 莫娜 -25.0001 迷你 -25.000 丽塔 -25.0

2.4 Shadab 8 Varun 8.9 Sarvesh 9.5 Harsh 10

n=int(input())

l=[]

for i in range(n*2) :

    ele=input()

    l.append(ele) 

l2=[]

for i in range(1,n*2,2) :

    l2.append(l[i])

l2.sort()

a=min(l2)

for i in range(n) :

    for i in l2 :

        if i == a :

            l2.remove(i)

b=min(l2)

l3=[]

for i in range(n*2) :

    if l[i] == b :

        l3.append((l[i-1]))

l3.sort()

for i in range(len(l3)) :

    print(l3[i])

Answer 1

它对我有用。如果需要，您可以分配 inf 而不是 1000。if __name__ == '__main__':&nbsp; &nbsp; d_list=[]&nbsp; &nbsp; low=[1000,1000]&nbsp; &nbsp; for _ in range(int(input())):&nbsp; &nbsp; &nbsp; &nbsp; name = input()&nbsp; &nbsp; &nbsp; &nbsp; val = float(input())&nbsp; &nbsp; &nbsp; &nbsp; if val < low[0]:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; low[1]=low[0]&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; low[0]=val&nbsp; &nbsp; &nbsp; &nbsp; elif val < low[1] and val >low[0]:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; low[1]=val&nbsp; &nbsp; &nbsp; &nbsp; if val<=low[1]:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; d_list.append([name,val])&nbsp; &nbsp; for student in sorted(d_list):&nbsp; &nbsp; &nbsp; &nbsp; if student[1]==low[1]:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; print(student[0])

Answer 2

no_of_students = int(input())records = []for i in range(no_of_students):&nbsp; &nbsp; name = input()&nbsp; &nbsp; score = float(input())&nbsp; &nbsp; records.append([name, score])records = dict(records)scores = sorted(set(records.values()))second_lowest_score = scores[1]second_lowest_students = [name for name,score in records if&nbsp;score==second_lowest_score]second_lowest_students.sort()for name in second_lowest_students:&nbsp; &nbsp; print(name)

Answer 3

t = int(input())name = []marks = []for i in range(t):&nbsp; &nbsp; n = input()&nbsp; &nbsp; m = input()&nbsp; &nbsp; name.append(n)&nbsp; &nbsp; marks.append(float(m))d_marks = []for i in range(t):&nbsp; &nbsp; if(marks[i] not in d_marks):&nbsp; &nbsp; &nbsp; &nbsp; d_marks.append(marks[i])d_marks.sort()s_min = float(d_marks[1])l = []for i in range(t):&nbsp; &nbsp; if(float(marks[i]) == s_min):&nbsp; &nbsp; &nbsp; &nbsp; l.append(name[i])l.sort()for i in range(len(l)):&nbsp; &nbsp; print(l[i])