每组输入两个要输入n组，把这n组按照每组的第一个数进行排序

import java.util.Comparator;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;


public class paixu {


public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int m=in.nextInt();
TreeMap<Integer,Integer> map=new TreeMap<Integer,Integer>(new Comparator<Integer>(){


@Override
public int compare(Integer o1, Integer o2) {

return o1.compareTo(o2);
}

});


while(in.hasNext()){
for(int k=0;k<m;k++){
int t=in.nextInt();
int p=in.nextInt();
map.put(t,p);
}
break;
}
for(Map.Entry<Integer, Integer> n:map.entrySet()){
System.out.println(n.getKey()+":"+n.getValue());

}



}


}