[Python] 백준 11557 - Yangjojang of The Year

문제

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

 

해설

해시 맵을 이용하여 해결하였다.

 

def solution(n):
    for _ in range(n):
        univ_cnt = int(input())
        
        univ_map = dict()
        for _ in range(univ_cnt):
            univ, bottle = input().split()
            bottle = int(bottle) 
            if univ in univ_map:
                univ_map[univ] += bottle
            else:
                univ_map[univ] = bottle

        max_univ = max(univ_map, key=univ_map.get)
        print(max_univ)


n = int(input())  # Number of test cases
solution(n)