题解 | #查找兄弟单词#

import sys
inn = input().split()
n = int(inn[0])
k = int(inn[n+2])
le = inn[n+1]
br = inn[1:n+1]
def bro(a,b):
    if a==b:
        return 0
    if len(a)!=len(b):
        return 0
    aa,bb = {},{}
    for i in a :
        if i in aa:
            aa[i] = aa[i]+1
        else:
            aa[i] = 1
    for i in b :
        if i in bb:
            bb[i] = bb[i]+1
        else:
            bb[i] = 1
    if len(aa)!=len(bb):
        return 0
    for key in aa:
        if key not in bb:
            return 0
        if aa[key]!=bb[key]:
            return 0
    return 1
ss = []
for i in br:
    if bro(le,i):
        ss.append(i)
ss.sort()
print(len(ss))
if len(ss)!=0 and k<=len(ss):
    print(ss[k-1])

直接暴力