#1032 挖掘机技术哪家强 (20 分)
代码展示:
N = int(input())
info = [-1 for i in range(100010)]
for i in range(N):
id, grade = list(map(eval,input().split()))
if info[id] == -1:
info[id] = 0
info[id] += grade
max_grade = max(info)
max_id = info.index(max_grade)
print(max_id,max_grade)
测评结果: