题解 | #删除字符串中出现次数最少的字符#

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

int main(){

    string s;
    while(cin>>s){
        unordered_map<char, int> mp;
        for(auto ch:s){
            mp[ch]++;
        }
        vector<pair<char,int>> vec;
        for(auto &it:mp){
            vec.push_back(it);
        }
        sort(vec.begin(),vec.end(),[](pair<char,int> a,pair<char,int> b){return a.second<b.second;});
        int min_num = vec[0].second;
        string new_ans;
        for(int i = 0; i<s.size(); i++ ){
            if(mp[s[i]]!= min_num){
                new_ans.push_back(s[i]);
            }
        }
        cout<<new_ans<<endl;
    }
}