/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 vote169 views1 answer
Hello world c++ visual studio
C++
0 vote217 views1 answer
Circular array
C++
0 vote173 views1 answer
Distructor of the node of the link list
C++
3 votes174 views1 answer
Map declaration c++
C++
0 vote176 views1 answer
Search a word in cpp file
C++
0 vote172 views1 answer
Change to lowercase in notepad++
C++
-1 vote173 views3 answers
Convert c code to c++
C++
1 vote183 views1 answer
C++ std::fmin
C++
1 vote164 views1 answer
Google spreadsheets add two strings
C++
4 votes170 views1 answer
Shuffle vector c++
C++