题解 | #查找兄弟单词#
查找兄弟单词
https://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
s=input().split(' ')
n=int(s[0])
x=s[1:n+1]
a=s[n+1]
k=int(s[-1])
count=0
y=[]
for i in x:
if i!=a and sorted(list(i))==sorted(list(a)):
count+=1
y.append(i)
print(count)
yy=sorted(y)
if k<=len(y):
print(yy[k-1])
