题解 | 查找兄弟单词

arr = input().split()
n = int(arr[0])  # n个字符串
k = int(arr[-1])  # 要输出第k个兄弟单词
x = arr[-2]  # 单词样例
s = arr[1:-2]  # n个字符串
arr = None  # 释放内存
# 先判断x存不存在兄弟单词
if len(set(x)) == 1:
    print(0)
    exit()

# 兄弟单词数量=2**len(set(x))-1
bro_s = []

for i in range(len(s)):
    if len(s[i]) != len(x):  # 长度不相同，一定不是兄弟单词
        continue
    if sorted(x) == sorted(s[i]) and s[i] != x:  # 排序后相同即为兄弟单词
        bro_s.append(s[i])
# print("s:",s)
# print("x:",x)
print(len(bro_s))
bro_s = sorted(bro_s)
if k <= len(bro_s):
    print(bro_s[k - 1])