题解 | #查找兄弟单词#
查找兄弟单词
http://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
s = input().split()
n = int(s.pop(0))
k = int(s.pop())
std = s.pop()
res =[]
for x in s:
if x == std:
continue
elif sorted(std)==sorted(x):
res.append(x)
res.sort()
print(len(res))
if len(res)>k:
print(res[k-1])
投递深圳同为数码等公司10个岗位