题解 | #查找兄弟单词#

import java.util.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            String[] str = in.nextLine().split(" ");
            int N = Integer.parseInt(str[0]);
            String mb = str[N + 1];
            int mb_m = 0;
            for (char b : mb.toCharArray()) {
                mb_m = mb_m + b * b * b;
            }
            Map<String, Integer> map = new TreeMap<>();
            for (int i = 1; i <= N; i++) {
                int ii_m = 0;
                for (char b : str[i].toCharArray()) {
                    ii_m = ii_m + b * b * b;
                }
                if (ii_m == mb_m && !str[i].equals(mb)) {
                    if (map.get(str[i]) == null) map.put(str[i], 1);
                    else map.put(str[i], map.get(str[i]) + 1);
                }
            }
            int sum = 0;
            for (int b : map.values()) {
                sum = sum + b;
            }
            System.out.println(sum);
            int j = 0;
            for (String b : map.keySet()) {
                if (j < Integer.parseInt(str[N + 2]) && Integer.parseInt(str[N + 2]) <= j+map.get(b)) {
                    System.out.println(b);
                }
                j = j + map.get(b);
            }
        }
    }
}