/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 vote314 views1 answer
Can you chnage the address of a pointer
C++
0 vote297 views3 answers
Options select from array
C++
0 vote320 views1 answer
Cpp pass function with input to thread
C++
0 vote290 views1 answer
Set Specific Time in youtube Video url
C++
1 vote285 views2 answers
How to print text on C++
C++
0 vote332 views2 answers
Avl tree c++
C++
0 vote330 views1 answer
How to check size of file in c++
C++
0 vote287 views1 answer
Q10
C++
2 votes323 views1 answer
Priority queue in c++
C++
5 votes305 views1 answer
Best clips recording software for cs go
C++