/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 vote331 views1 answer
Initialize variable in switch case c++
C++
0 vote320 views1 answer
Get elements of 2d array c++
C++
0 vote323 views1 answer
Cout stack in c++
C++
0 vote329 views1 answer
Allow cross origin
C++
1 vote305 views1 answer
Operator overloading
C++
0 vote346 views1 answer
C++ sort
C++
0 vote312 views1 answer
400 watt hour per kg
C++
0 vote314 views1 answer
Cpp mutex
C++
2 votes356 views1 answer
Ph vid
C++
12 votes316 views2 answers
Underline in latex
C++