/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 vote98 views1 answer
Template function in class c++
C++
0 vote101 views1 answer
Character convert c++
C++
8 votes71 views1 answer
How to print every element of the array in cpp
C++
0 vote134 views1 answer
How to scan vector in c++
C++
0 vote111 views1 answer
Take pieces of a string in c++
C++
6 votes101 views3 answers
Print float up to 3 decimal places in c++
C++
9 votes113 views3 answers
String iterator in c++
C++
1 vote94 views1 answer
C++ lock
C++
0 vote96 views1 answer
C++ throw index out of bound
C++
0 vote104 views1 answer
Accpt array input in single line in cpp
C++