题解 | #华为no.8 合并表记录#

使用排序map(引入java.io.*),遍历输入并且遍历输出

import java.io.*;
public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        TreeMap<Integer,Integer> map = new TreeMap<>();
        for(int i=0;i<n;i++) {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if (map.containsKey(key)) {
                map.put(key,val+map.get(key));
            } else {
                map.put(key,val);
            }
        }
        Iterator it = map.keySet().iterator();
        while (it.hasNext()) {
            int key = (Integer) it.next();
            System.out.println(key+" "+map.get(key));
        }
    }
}