题解(屎山) | #合并表记录#

n = int(input())
dic = {}
index=[]
values = []
for i in range(n):
    line = input().split()
    ind, value = line
    index.append(ind)
    values.append(int(value))

seen = []
pairs = {}
for i in range (n):
    if index[i] not in seen:
        seen.append(index[i])
        pairs[index[i]] = values[i]
    else:
        pairs[index[i]]=pairs.get(index[i])+values[i]
keys_int = []
keys = pairs.keys()
for i in pairs.keys():
    keys_int.append(int(i))
keys_int = sorted(keys_int)
for i in keys_int:
    print(i, pairs.get(str(i)))