哈希表+大根堆

struct cmp
{
    bool operator()(pair<string,int> const &left,pair<string,int> const &right)
    {
        if(left.second == right.second) return left.first > right.first;
        return left.second < right.second;
    }
};

priority_queue<pair<string,int>,vector<pair<string,int>>,cmp> pq;