倒置排序

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
    public static void main(String[] ar) {
		Scanner cin=new Scanner(System.in); 
		int n=cin.nextInt();
		for(int i=0;i<n;i++)
		{
			int n1=cin.nextInt();
			Map<Integer, Integer>map=new TreeMap<Integer,Integer>();
			for(int j=0;j<n1;j++)
			{
			    int a=cin.nextInt();
			    String s=a+"";
			    StringBuffer ss=new StringBuffer(s);
			    String reverse_s=ss.reverse().toString();
			    map.put(a, Integer.parseInt(reverse_s));
			}
			List<Map.Entry<Integer, Integer>>list=new  ArrayList<>(map.entrySet());
			Collections.sort(list,new Comparator<Map.Entry<Integer, Integer>>()
			{
				public int compare(Map.Entry<Integer, Integer>o1 ,Map.Entry<Integer, Integer>o2)
				{
					return o1.getValue()-o2.getValue();
				}
			});
			for(Map.Entry<Integer, Integer>num:list)
			{
				System.out.print(num.getKey()+" ");
			}
			System.out.println();
		}
    }
}