Sort by

recency

|

4677 Discussions

|

  • + 0 comments

    lst = []

    for _ in range(int(input())): name = input() score = float(input()) lst.append([name, score])

    Step 1: Extract all unique scores and sort them

    scores = sorted(set([score for name, score in lst]))

    Step 2: Get the second lowest score

    second_lowest = scores[1]

    Step 3: Get all names with the second lowest score

    names = sorted([name for name, score in lst if score == second_lowest])

    Step 4: Print the names

    for name in names: print(name)

  • + 0 comments
    if __name__ == '__main__':
        students = []
        runnerups = []
        
        for _ in range(int(input())):
            name = input()
            score = float(input())
            student = [score,name]
            students.append(student)    
        
        students = sorted(students)    
    
        for student in list(set(map(tuple, students))):
            if student[0] == students[1][0]:
                runnerups.append(student[1])
        
        for student in runnerups:
            print(student)
        
        
    
  • + 0 comments

    if name == 'main': add = [] for _ in range(int(input())): name = input() score = float(input()) add.append([name,score])

    new = [ lis[1] for lis in add]
    
    new = list(set(new))
    new.sort()
    end = [ lis for lis in add if new[1] == lis[1]]
    end = [ lis[0] for lis in end]
    end.sort()
    for name in end:
        print(name)
    
  • + 0 comments

    if name == 'main': t= int(input()) n=[] for _ in range(t): name = input() n.append(name) score = float(input()) n.append(score) s=[] for i in range(1,2*t,2): s.append(n[i]) se = sorted(set(s) ) slo = se[1] res=[] for i in range(2*t): if n[i]==slo: res.append(n[i-1]) if len(res)>1: res.sort() print("\n".join(res)) else: print(res[0])

  • + 0 comments
    def find_second_min(arr):
        min_val=99999999
        second_min=9999999
        for i in range(len(arr)):
            if arr[i]<min_val:
                second_min=min_val
                min_val=arr[i]
            if arr[i] > min_val and arr[i] < second_min:
                second_min = arr[i]
        return second_min
    
    if __name__ == '__main__':
        name_list=[]
        score_list=[]
        R=[]
        for _ in range(int(input())):
            name = input()
            score = float(input())
            name_list.append(name)
            score_list.append(score)
        second_min=find_second_min(score_list)
        for i in range(len(score_list)):
            if score_list[i]==second_min:
                R.append(name_list[i])
        for i in (sorted(R)):
            print(i)