/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

174 votes201 views15 answers
Int to string c++
C++
1 vote118 views1 answer
Integer type validation c++
C++
7 votes147 views2 answers
Count number of char in a string c++
C++
3 votes125 views1 answer
Differentialble programming
C++
-1 vote93 views1 answer
Dynamic 2d array c++
C++
0 vote125 views1 answer
How to create an ArrayList
C++
1 vote161 views1 answer
C++ directory listing
C++
1 vote132 views1 answer
Vector with pinter cout c++
C++
0 vote123 views1 answer
How to use mersenne_twister_engine in c++ to generate random numbers
C++
4 votes141 views2 answers
Jupyter lab use conda environment
C++