/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 votes200 views2 answers
Vector.find()
C++
0 vote194 views1 answer
How to save system function output into a variable in c++
C++
1 vote189 views1 answer
Isalpha c++
C++
0 vote212 views4 answers
How to make a square root function in c++ without stl
C++
2 votes181 views2 answers
C++ sum the digits of an integer
C++
0 vote210 views1 answer
Write a C++ program to Computing Mean and Median Using Arrays
C++
0 vote212 views2 answers
C++ server service ros
C++
0 vote223 views1 answer
Time and date (tm structure ) in C++
C++
1 vote195 views1 answer
Std means in programming
C++
0 vote231 views1 answer
Qt file explorer
C++