/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

2 votes110 views2 answers
File open cpp
C++
1 vote198 views10 answers
Java
C++
6 votes112 views2 answers
Stack erase
C++
6 votes152 views2 answers
Find permutations
C++
0 vote124 views1 answer
Play roblox vr on quest 2
C++
5 votes111 views2 answers
Getline trong c++
C++
1 vote122 views4 answers
Sum vector c++
C++
0 vote145 views1 answer
Find number of 1s in a binary cv::mat image
C++
0 vote132 views1 answer
Uses of gamma rays
C++
-1 vote115 views1 answer
Assigning a seed on a random number generator in C++
C++