题解 | 查找兄弟单词

#include <iostream>
#include <linux/limits.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

bool isBrother(const string& s, const string& x) {
    if (s.length() != x.length()) return false;
    if (s == x) return false;
    int count[26] = {0};
    for (char c : x) {
        count[c - 'a']++;
    }
    for (char c : s) {
        count[c - 'a']--;
        if (count[c - 'a'] < 0) {
            return false;
        }
    }
    return true;
}
int main()
{
    int n , k;
    string x;
    cin >> n;
    vector<string> str(n);
    for(int i = 0 ; i < n ; i++)
    {
        cin >> str[i];
    }
    cin>> x;
    cin>> k;
    vector<string> bro;
    for(const string& word : str)
    {
        if(isBrother(word , x))
        {
            bro.push_back(word);
        }
    }
    
    sort( bro.begin() , bro.end());
    cout << bro.size() <<endl;
    if( k <= bro.size())
    {
        cout << bro[k-1] << endl;
    }    
    return 0;
}