题解 | 查找兄弟单词

s = input()
words = s.split(" ")
n = int(words[0])
x = words[n+1]
k = int(words[n+2])
bros = []
for i in range(1,n+1):
    word = words[i]
    if sorted(word)==sorted(x) and word!=x:
        bros.append(word)
print(len(bros))
bros.sort()
if k<=len(bros):
    print(bros[k-1])