使用了TreeMap,实现了键值对对应以及排序

import java.util.Scanner;
import java.util.TreeMap;
import java.util.Map;
public class Main{
    public static void main(String... args){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        Map<Integer,Integer> map = new TreeMap<>();
        for(int i = 1; i <= n; i++){
            int index = scan.nextInt();
            int value = scan.nextInt();
          //这里使用了merge方法,以及lambda表达式
            map.merge(index,value,(oldvalue,newvalue)->oldvalue+newvalue);
        }
      //遍历
            map.forEach((index,value)->System.out.println(index+" "+value));
    }
}