/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 votes206 views2 answers
Poland
C++
2 votes247 views1 answer
Endl in c++ means
C++
1 vote246 views1 answer
Isalpha c++
C++
3 votes253 views1 answer
Swap values in array c++
C++
7 votes258 views1 answer
Migration meaning
C++
0 vote256 views1 answer
C++ define array with values
C++
1 vote320 views1 answer
How to compile opencv c++ in ubuntu
C++
0 vote277 views2 answers
Method
C++
5 votes233 views1 answer
C++ - include all libraries
C++
0 vote246 views1 answer
Calculate if year is leap year
C++