/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 vote339 views1 answer
Std::map get all keys
C++
-1 vote339 views1 answer
How to make sound in c++
C++
1 vote363 views1 answer
Fibonacci series in c++ Recursive
C++
1 vote318 views1 answer
Declare nullptr c++
C++
0 vote331 views1 answer
Why do men drink liquor
C++
4 votes402 views3 answers
Clear screen in c++
C++
0 vote347 views1 answer
C++ map values range
C++
0 vote342 views1 answer
Use uint in c++
C++
1 vote335 views1 answer
Quotation in c++ string
C++
18 votes338 views3 answers
How to make a 2d vector in c++
C++