小白鼠再排队

方法1：使用Arrays.sort()

import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner cin=new Scanner(System.in);       
        int n =cin.nextInt();
        Mouse[] m=new Mouse[n];
        for(int i=0;i<n;i++)
        {
        	m[i]=new Mouse(cin.nextInt(),cin.next());
        }
        Arrays.sort(m,(m1,m2)->m1.weight-m2.weight);
        for(Mouse mm:m)
        {
        	System.out.println(mm.color);
        }
    } 
}	
    class Mouse
    {
    	int weight;
    	String color;
		public Mouse(int weight,String color)
		{
			super();
			this.weight=weight;
			this.color=color;
		}
    }

方法2：使用TreeMap

import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
    public static void main(String[] args) {
        Scanner cin=new Scanner(System.in);       
        int n =cin.nextInt();
        TreeMap<Integer ,String> t=new TreeMap<>();
        for(int i=0;i<n;i++)
        {
        	t.put(cin.nextInt(),cin.next());
        }
        for(String color:t.values())
        {
        	System.out.println(color);
        }
    }       
}