/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

2 votes134 views1 answer
Sfml draw tex
C++
0 vote157 views1 answer
Inverse lerp c++
C++
-2 votes139 views1 answer
How to iterate through array in c++
C++
1 vote144 views1 answer
C++ keyboard input
C++
4 votes143 views2 answers
Float to int c++
C++
1 vote134 views1 answer
Name one example of a “decider” program that you regularly encounter in real life.
C++
1 vote144 views1 answer
Collections c# vs c++
C++
24 votes147 views3 answers
C++ function
C++
0 vote144 views1 answer
Printing in column c++
C++
2 votes150 views1 answer
Cin.tie c++
C++