/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 vote298 views1 answer
#defie in c++
C++
0 vote148 views1 answer
Sleep not declared in this scope c++
C++
0 vote188 views1 answer
Priority queue smallest first
C++
5 votes199 views10 answers
Array
C++
30 votes292 views5 answers
Remove value from vector c++
C++
-1 vote246 views1 answer
C++ forloop
C++
1 vote189 views1 answer
Gfg cyclic array rotation
C++
3 votes218 views4 answers
String c++
C++
1 vote178 views1 answer
How to reset linerenderer unity
C++
5 votes191 views2 answers
String c++ if letter is lowercase
C++