/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

6 votes117 views6 answers
C++ for loop
C++
0 vote116 views1 answer
Get value of enum cpp
C++
1 vote102 views1 answer
Print linkedstack cpp
C++
2 votes104 views2 answers
What is typedef
C++
0 vote105 views1 answer
Auto& in c++
C++
0 vote117 views1 answer
Free a pointer c++
C++
6 votes154 views6 answers
Naruto
C++
0 vote51 views2 answers
Average of vector c++
C++
6 votes100 views4 answers
String to upper c++
C++
0 vote98 views1 answer
How to check private messages on reddit
C++