/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

5 votes355 views2 answers
Time measurement c++
C++
0 vote331 views1 answer
Arduino jumper programmieren
C++
0 vote357 views1 answer
Cuda shared variable
C++
1 vote326 views1 answer
Visual studio cpp compiler
C++
0 vote346 views1 answer
Pause the console c++
C++
0 vote347 views1 answer
Find first of a grammar
C++
2 votes332 views1 answer
Sfml draw tex
C++
0 vote324 views1 answer
Waiting in a serial as the spool reflect the queue operation. Demonstrate Printer Behavior in context of Queue.Subject to the Scenario implement the Pop and Push Using C++.
C++
0 vote332 views1 answer
C++ json parser euc-kr
C++
0 vote333 views2 answers
How to create array with not constant size in cpp
C++