题解 | #查找兄弟单词#

import java.util.*;
public class Main {
    static Scanner in = new Scanner(System.in);
    public static void main(String[] args) {
        int n = in.nextInt();
        String[] srr = new String[n];
        for (int i = 0; i < n; i ++ ) 
            srr[i] = in.next();
        String x = in.next();
        int k = in.nextInt();
        int cnt = 0;
        List<String> list = new ArrayList<>();
        for (String str : srr) {
            if (isBrother(str, x)) {
                cnt ++ ;
                list.add(str);
            }
        }
        System.out.println(cnt);
        if (list.size() >= k) {
            list.sort((a, b)->a.compareTo(b));
        System.out.println(list.get(k - 1));
        }
        
    }
    static boolean isBrother(String a, String b) {
        if (a.equals(b) || a.length() != b.length()) 
            return false;
        char[] c1 = a.toCharArray();
        char[] c2 = b.toCharArray();
        Arrays.sort(c1);
        Arrays.sort(c2);
        return String.valueOf(c1).equals( String.valueOf(c2));
    }
}