/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

1 vote153 views3 answers
Print 2d vector c++
C++
0 vote122 views1 answer
Std::set remove item
C++
0 vote107 views1 answer
How to use getline function inc
C++
3 votes111 views4 answers
Or in cpp
C++
0 vote124 views1 answer
How to get the time in c++ as string
C++
4 votes167 views1 answer
Continue c++
C++
1 vote115 views1 answer
What are specialized classes c++
C++
1 vote105 views1 answer
For loop vector
C++
3 votes106 views1 answer
Abs c++
C++
0 vote125 views1 answer
Exit: redefinition; '__declspec(noreturn)' or '[[noreturn]]'
C++