c++题解 | #查找兄弟单词 30行代码#

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main (){
    int N, k;
    cin >> N;
    vector<string> input(N), output;
    for(int i = 0; i < N; ++i)
        cin >> input[i];
    string target;
    cin >> target >> k;
    for(int i = 0; i < N; ++i){
        bool flag = true;
        if(input[i].size() != target.size() || input[i] == target)
            continue;
        for(int j = 0; j < input[i].size(); ++j){
            string::iterator it = find(input[i].begin(), input[i].end(), target[j]);
            if(it == input[i].end() || count(input[i].begin(), input[i].end(), *it) != count(target.begin(), target.end(), *it))
                { flag = false; break;}
        }
        if(flag == true)
            output.push_back(input[i]);
    }
    sort(output.begin(), output.end());
    cout << output.size() << endl;
    if(k <= output.size())
        cout << output[k-1];
}