/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 vote238 views1 answer
C++ clear char array
C++
0 vote238 views1 answer
TCA9548 I2CScanner Arduino
C++
0 vote266 views1 answer
How to cehck if list has element c++
C++
0 vote249 views1 answer
Fname from FString
C++
0 vote236 views1 answer
Smooth Poti values on Arduino
C++
5 votes283 views3 answers
Fast io c++
C++
1 vote232 views1 answer
Unclebigbay
C++
0 vote205 views1 answer
Cpp function that returns two arguments
C++
1 vote243 views1 answer
Chrono library c++
C++
7 votes260 views1 answer
Nearest integer rounding in c++
C++