/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

4 votes175 views1 answer
Delete 2d dynamic array c++
C++
8 votes155 views4 answers
How print fload wiht 3 decimal in c++
C++
1 vote152 views1 answer
How to ensure the user inouts a int and not anything else c++
C++
1 vote187 views1 answer
Remove () not working c++
C++
0 vote154 views1 answer
Gamemaker studio
C++
13 votes153 views5 answers
Max of a vector c++
C++
5 votes159 views1 answer
All library in c++
C++
23 votes156 views3 answers
Flutter datetime format
C++
13 votes158 views3 answers
C++ remove last element from vector
C++
6 votes173 views9 answers
Preorder to postorder converter online
C++