1 struct cmp 2 { 3 template <typename T, typename U> 4 bool operator()(T const &left,U const &right) 5 { 6 if(left.second == right.second) return left.first > right.first; 7 return left.second < right.second; 8 } 9 }; 10 11 priority_queue<pair<string,int>,vector<pair<string,int>>,cmp> pq;
哈希表+大根堆
猜你喜欢
转载自www.cnblogs.com/yuhong1103/p/12669940.html
今日推荐
周排行