题解 | 拉票

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

int main() {
    int n, x;
    cin >> n >> x;
    // cout << n<<x << endl;
    unordered_map<int , int> count;
    while(n--){
        int m;
        cin>>m;
        count[m]++;
    }
    int res = count[x];
    count.erase(x);
    if(count.empty()) {
        cout<<res<<"\n";
        return 0;
    }
    vector<pair<int,int>> count_vec;
    count_vec.reserve(count.size());
    for(const auto &[key,value]:count){
    //     cout<<"key:"<<key<<" value:"<<value<<endl;
        count_vec.emplace_back(key,value);
    }
    auto cmp = [](const pair<int,int> &a,const pair<int,int> &b) 
                    {return a.second>b.second;};//降序
    sort(count_vec.begin(),count_vec.end(),cmp);
    // for(const auto &[key,value]:count_vec){
    //     cout<<"key:"<<key<<" value:"<<value<<endl;
    // }
    
    res += count_vec[0].second;
    cout<<res<<"\n";

    return 0;
}
// 64 位输出请用 printf("%lld")