/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 votes420 views4 answers
Bubble Sort
C++
0 vote349 views1 answer
Implicit conversion casting
C++
2 votes379 views1 answer
Null c++
C++
4 votes317 views1 answer
Cin statement c++
C++
3 votes366 views2 answers
Precision of fixed in c++
C++
0 vote385 views1 answer
Equalize problem codeforces
C++
0 vote392 views1 answer
Get type of variable in c++
C++
0 vote322 views1 answer
Prevent copy c++
C++
0 vote287 views2 answers
Average of vector c++
C++
0 vote398 views1 answer
Cpp language explained
C++