/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

0 vote161 views2 answers
C++ typeid
C++
0 vote141 views1 answer
Add two constant char pointers c++
C++
19 votes180 views5 answers
When kotlin
C++
1 vote158 views1 answer
Xmake set exe name
C++
0 vote159 views1 answer
Find the biggest element in the array
C++
0 vote149 views1 answer
How to get a section of a string in c++
C++
0 vote141 views1 answer
Mpgh dbd
C++
0 vote95 views1 answer
List that doesn't allow duplicates c++
C++
0 vote144 views1 answer
C++ sorting and keeping track of indexes
C++
2 votes139 views1 answer
Pointer dereference
C++