/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 vote266 views1 answer
Reverse Square Root
C++
4 votes269 views3 answers
REFERENCE C++
C++
12 votes282 views4 answers
Sort function descending c++
C++
0 vote247 views1 answer
Copy file to vector c++
C++
12 votes214 views3 answers
Continue c++
C++
5 votes240 views3 answers
Sql server convert utc to pst SQL command
C++
0 vote345 views2 answers
Ue4 c++ enum variable declaration
C++
5 votes262 views1 answer
What library to mention for swap function in c++
C++
1 vote247 views1 answer
64 bit unsigned integer c++
C++
1 vote336 views10 answers
Java
C++