/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 vote120 views1 answer
Split text c++
C++
174 votes165 views15 answers
Int to string c++
C++
0 vote97 views1 answer
C++ add everything in a vector
C++
2 votes104 views1 answer
C++ custom comparator for elements in set
C++
0 vote109 views1 answer
Write a C++ program to Computing Mean and Median Using Arrays
C++
10 votes110 views2 answers
C++ function inside main
C++
4 votes110 views4 answers
Pointer
C++
13 votes99 views5 answers
Max of a vector c++
C++
1 vote105 views3 answers
Google snake game
C++
1 vote108 views1 answer
Turn github into vscode
C++