/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 vote122 views1 answer
C++ tokenize string
C++
1 vote136 views1 answer
Hello world programming
C++
0 vote87 views1 answer
Prefix array algorithm in c++
C++
0 vote132 views1 answer
C++ erase remove
C++
6 votes145 views4 answers
C++ char to uppercase
C++
0 vote156 views1 answer
Alias namespaces c++
C++
1 vote139 views10 answers
Js
C++
4 votes133 views2 answers
Max value of double c++
C++
2 votes131 views1 answer
How to complie with c++ 17
C++
7 votes134 views2 answers
Round c++
C++