/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 votes150 views3 answers
Converting char to int in c++
C++
0 vote132 views1 answer
How to block the screen c++
C++
0 vote138 views1 answer
Shift element to end of vector c++
C++
1 vote144 views1 answer
Get a string from file in c++
C++
5 votes149 views1 answer
How to disable buttons in unity
C++
0 vote149 views1 answer
Bitwise operator in C++ example programs
C++
0 vote134 views1 answer
Public method
C++
0 vote155 views1 answer
A suprise... c++
C++
0 vote139 views1 answer
C++ pause linux
C++
0 vote145 views1 answer
Servicenow cart api
C++