/C++/Priority queue ordered by second element

Priority queue ordered by second element

#include <bits/stdc++.h>
using namespace std;

typedef pair<string, int> Max;
struct Compare {
    bool operator()(Max a, Max b) {
        return a.second < b.second;
    }
};

int main() {
    //Max heap custom data type
    priority_queue<Max, vector<Max>, Compare> p;
    p.push(make_pair("a", 1));
    p.push(make_pair("c", 1));
    p.push(make_pair("b", 3));

    while (!p.empty()) {
        Max top = p.top();
        cout << top.first << " => " << top.second << "\n";
        p.pop();
    }
    /*
    * OUTPUT:
    * b = 3
    * a = 1
    * c = 1
    */
}

Similar codes

0 vote244 views1 answer
Function return floatin c++
C++
2 votes268 views1 answer
C++ switch string
C++
1 vote255 views1 answer
Find largest number in vector c++
C++
0 vote255 views1 answer
C++ classes
C++
0 vote272 views1 answer
All in one c++
C++
0 vote312 views1 answer
Binpow in fenwick tree
C++
0 vote266 views1 answer
Ue_log example
C++
1 vote275 views2 answers
Ue4 c++ enumaeration
C++
2 votes293 views2 answers
Array and for loop in c++
C++
0 vote272 views1 answer
Get player pawn
C++