/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 vote315 views1 answer
Format string cpp
C++
0 vote318 views1 answer
Opencv rgb to gray c++
C++
0 vote317 views1 answer
Quicksort taking random pivot
C++
12 votes305 views2 answers
Underline in latex
C++
1 vote300 views1 answer
Collections c# vs c++
C++
0 vote331 views1 answer
C++ sorting and keeping track of indexes
C++
0 vote345 views1 answer
File streams in c++
C++
1 vote286 views1 answer
C++ initialize static variable
C++
0 vote373 views1 answer
Sort vector of strings
C++
0 vote315 views1 answer
Find maximum contiguous Sub arrays
C++