백준 11557 Yangjojang of The Year | 파이썬

 

https://www.acmicpc.net/problem/11557

11557번: Yangjojang of The Year

#B11557
#1 딕셔너리
t= int(input())
for _ in range(t):
    n = int(input())
    dic = {}
    max = 0
    for i in range(n):
    	school, alcohol = input().split()
    	dic[alcohol] = school
    for j in dic.keys():
    	if int(max) < int(j):
    		max = j
    print(dic[max])
    

    
    
    
#2 lambda    
for t in range(int(input())):
    arr = []
    for n in range(int(input())):
        school, alcohol = input().split()
        arr.append([school, int(alcohol)])
    arr.sort(key = lambda x : x[-1])	
    print(arr[-1][0])
    
    
    
    

#3 인덱스
for t in range(int(input())):
    arr_sc = []
    arr_al = []
    n = int(input())
    for _ in range(n):
        school, alcohol = input().split()
        arr_sc.append(school)
        arr_al.append(int(alcohol))
    idx = arr_al.index(max(arr_al))
    print(arr_sc[idx])