题解 | #查找兄弟单词#

#include <iostream>
#include <list>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;

bool is_brothers(string a,string b){
    if(a==b)return false;
    int a_size=a.size(),b_size=b.size();
    if(a_size!=b_size)return false;
    vector<int>target_ump(26,0);

    for(char ch:a)
        target_ump[ch-'a']++;
    for(char ch:b)
    {
        if(target_ump[ch-'a']==0)return false;
        else 
        target_ump[ch-'a']--;
    }

    for(int x:target_ump)
        if(x!=0)return false;

    return true;
}

int main(){
    int N=0;

    while(cin>>N){
        list<string> str_list;
        int k=0;
        string str="",target="";
        for(int i=0;i<N;i++){
            cin>>str;
            str_list.push_back(str);
        }
        cin>>target>>k;

        vector<string> result;
        for(auto itr=str_list.begin();itr!=str_list.end();itr++){
            if(is_brothers(target, *itr))
                result.push_back(*itr);
        }
        stable_sort(result.begin(), result.end());
        cout<<result.size()<<endl;
        if(k<result.size())cout<<result[k-1]<<endl;
        return 0;
    }
}