/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 vote132 views1 answer
Math in section title latex
C++
0 vote129 views1 answer
Std::gcd
C++
1 vote123 views1 answer
Make cin cout faster
C++
3 votes126 views2 answers
Define and show the implementation of the functions of an arrayList.
C++
0 vote129 views1 answer
Txt to pdf CPP
C++
0 vote128 views1 answer
Bnchch
C++
2 votes137 views1 answer
Tribonacci series c++
C++
10 votes127 views3 answers
C++ int to char*
C++
0 vote122 views1 answer
C++ start thread later
C++
0 vote116 views1 answer
C++ convert int to double
C++