/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 vote183 views1 answer
Xor in c++
C++
0 vote202 views1 answer
Print linked list reverse order in c++
C++
-1 vote186 views1 answer
How to print items in arduino
C++
2 votes196 views2 answers
2d array c++
C++
0 vote179 views1 answer
C++ programming
C++
0 vote188 views1 answer
Lua table contains
C++
2 votes194 views1 answer
How to write something in power of a number in c++
C++
1 vote185 views2 answers
Bool to string arduino
C++
0 vote189 views1 answer
Z transfrom mathlab
C++
4 votes182 views3 answers
REFERENCE C++
C++