题解 | #查找兄弟单词#
查找兄弟单词
https://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
string cur;
vector<string> rec_ori,rec_val;
while(n--){
cin >> cur;
rec_ori.push_back(cur);
sort(cur.begin(),cur.end());
rec_val.push_back(cur);
}
string key;
cin >> key;
int k;
cin >> k;
string key_ori=key;
sort(key.begin(),key.end());
int res=0;
vector<string> rec;
for(int i=0;i<rec_ori.size();i++){
if(rec_val[i]==key && rec_ori[i]!=key_ori){
res++;
rec.push_back(rec_ori[i]);
}
}
cout << res << endl;
sort(rec.begin(),rec.end());
int size=rec.size();
if(k<=size){
cout << rec[k-1] << endl;
}
}