/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 vote185 views1 answer
C++ multiply char
C++
0 vote189 views1 answer
C++ enum rand
C++
6 votes197 views2 answers
Stoi
C++
-1 vote183 views2 answers
C++ to mips assembly converter
C++
1 vote187 views1 answer
Traverse through a string cpp
C++
1 vote199 views1 answer
Collections c# vs c++
C++
0 vote185 views1 answer
Calculating Function codeforces in c++
C++
1 vote250 views1 answer
Joining two vectors in c++
C++
0 vote220 views1 answer
01matrix
C++
-1 vote207 views1 answer
Transformer in nlp
C++