查找兄弟单词

3 abc bca cab abc 1

2
bca

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

//判断两个字符串是否是兄弟单词
int isBrother(string findString,string v)//值传递，不更改原字符串
{
    //将字符串排序后再比较是否相同
    sort(findString.begin(),findString.end());
    sort(v.begin(),v.end());
    if(findString==v)
        return 1;
    else
        return 0;
}

int main()
{
    int n,index;
    vector<string> words;//字典容器
    vector<string> bother;//兄弟单词容器
    string findWord;
    string cinWord;
    while(cin>>n)
    {
        words.clear();//每次重新来过都要清空容器
        bother.clear();
        for(int i=0; i<n; i++)
        {
            cin>>cinWord;
            words.push_back(cinWord);
        }
        cin>>findWord;
        cin>>index;
        for(int i=0; i<n; i++)
        {
            //若字典中第i个单词和findword不同，并且isBrother()返回1
            if(findWord!=words[i] && isBrother(findWord,words[i]))
            {
                bother.push_back(words[i]);//将第i个单词装入兄弟单词容器
            }
        }
        sort(bother.begin(),bother.end());//将兄弟单词容器排序
        cout<<bother.size()<<endl;
        if(index<=bother.size())
        {
            cout<<bother[index-1]<<endl;//输出第index个兄弟单词
        }
    }
    return 0;
}