字符串排序

import java.util.Arrays;
import java.util.Scanner;




public class Main984 {
	static int reverse(String s)
	{
		int len=s.length();
		int sum=0;
		for(int i=0;i<len-1;i++)
		{
			for(int j=i+1;j<len;j++)
			{
				if(s.charAt(i)>s.charAt(j))
				{
					sum++;
				}
			}
				
		}
		return sum;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		String[] a=new String[n];
		for(int i=0;i<n;i++)
		{
			a[i]=sc.next();
		}
		Arrays.sort(a,(s1,s2)->reverse(s1)-reverse(s2));
	for(String s:a)
	{
		System.out.println(s);
	}
	}

}