/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

18 votes171 views5 answers
C++ clear console
C++
0 vote222 views1 answer
C++ basic snippet
C++
-1 vote162 views1 answer
C++ string to vector int
C++
2 votes166 views1 answer
Cpp starting code
C++
2 votes169 views1 answer
What is -> in c++
C++
1 vote168 views1 answer
Ifstream relative file path
C++
0 vote159 views1 answer
C++ print to standard error
C++
0 vote165 views1 answer
Dynamically allocate a string object and save the address in the pointer variable p.
C++
0 vote181 views1 answer
How to initialize 2d array with values c++
C++
1 vote165 views1 answer
Expected number of trials to get n consecutive heads
C++