/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 vote204 views1 answer
Dijkstra algorithm in c++ geeksforgeeks
C++
0 vote167 views3 answers
Bool function in c++
C++
2 votes215 views2 answers
Cannot open include file:
C++
0 vote180 views1 answer
C++ stoi binary negative number string to decimal
C++
-3 votes211 views1 answer
Array c plus plus
C++
102 votes441 views6 answers
Git config username and password
C++
0 vote205 views1 answer
C++ public inheritance not getting protected
C++
2 votes217 views1 answer
Unity failed to load window layout
C++
0 vote157 views1 answer
Take pieces of a string in c++
C++
0 vote173 views1 answer
QT form doesn't take changes
C++