/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

-1 vote145 views1 answer
How to rename a file in cpp
C++
7 votes142 views1 answer
Migration meaning
C++
0 vote135 views1 answer
Idnefier endl in undefince
C++
6 votes173 views5 answers
Cout
C++
0 vote154 views1 answer
"how we write a program for" time swap" in c plus plus only with string"
C++
0 vote145 views1 answer
Unpack tuple c++
C++
0 vote144 views1 answer
Run c++ program in mac terminal
C++
0 vote166 views1 answer
Iteraate through a vector
C++
0 vote139 views1 answer
C++ method name
C++
0 vote157 views1 answer
Bitmap rotate 90 deg
C++