Sort by

recency

|

4848 Discussions

|

  • + 0 comments

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

    sls=sorted(set(s)) s4=sls[1] sln=[] for i,j in r: if j==s4: sln.append(i)

    for i in sorted(sln): print(i)

  • + 0 comments

    if name == "main": records = []

    for _ in range(int(input())):
        name = input()
        score = float(input())
        records.append((name, score))
    
    # Get unique sorted scores
    scores = sorted({score for _, score in records})
    second_lowest = scores[1]
    
    # Collect and sort names with that score
    result = sorted(name for name, score in records if score == second_lowest)
    
    for name in result:
        print(name)
    
  • + 0 comments

    Python 3 solution:

    if __name__ == '__main__':
        res = []
        for _ in range(int(input())):
            name = input()
            score = float(input())
            res.append([name, score])
            
        unique_student = sorted(list(set([x[1] for x in res])))
        seccond_lowest = unique_student[1]
        final_names = sorted([stc[0] for stc in res if stc[1] == seccond_lowest])
        
        for fn in final_names:
            print(fn)
    
  • + 0 comments

    if name == 'main': list_of_students = [] for _ in range(int(input())): name = input() score = float(input()) list_of_students.append([name,score]) values = [x[1] for x in list_of_students] lowest_removed = [i for i in values if i != min(values)] secondlowestnames = [x[0] for x in list_of_students if x[1] == min(lowest_removed)] [print(x) for x in sorted(secondlowestnames)]

  • + 0 comments

    if name == 'main': d={} for _ in range(int(input())): name = input() score = float(input()) d.update({name:score}) scores = list(d.values()) minscore = float('inf') min2score = float('inf') for v in scores: if minscore>v: min2score = minscore minscore = v elif min2score>v and minscore