题解 | 小红书推荐系统

#include <iostream>
using namespace std;
#include<string>
#include<algorithm>
#include<vector>
#include<map>
struct re{
string s;
int v;


};
bool cmp(re& a,re& b){
if(a.v!=b.v){
return a.v>b.v;
}
return a.s<b.s;



}
int main(){
map<string,int> a;
string word;
while(cin>>word)
{
a[word]++;

}

int n=a.size();
vector<re> w;
for(auto it=a.begin();it!=a.end();it++){
    if(it->second>=3){
w.push_back({it->first,it->second});
    }
}
sort(w.begin(),w.end(),cmp);

for(auto it=w.begin();it!=w.end();it++){

cout<<it->s<<endl;


}







    return 0;
}