题解 | #查找兄弟单词#

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void async function () {
    // Write your code here
    while(line = await readline()){
        let lineArr = line.split(' ')
        let n = Number(lineArr.shift()) // 弹出 字典中单词个数
        let k = Number(lineArr.pop())	// 弹出 k
        let target = lineArr.pop()		// 弹出 被匹配的单词
        let t = target.split('').sort().join('')
        const match = []
        for(let str of lineArr) {
            if(str === target) continue	// 排除与被匹配单词完全相同的单词
            if(str.split('').sort().join('') === t) {	// 排序后相等即存入结果数组
                match.push(str)
            }
        }
        console.log(match.length)
        if(k < match.length) {
            console.log(match.sort()[k -1])	// 结果数组排序，获取第k个单词
        }
    }
}()