/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 vote249 views1 answer
Fill 2-dimensional array with value
C++
0 vote244 views1 answer
Esp
C++
0 vote223 views1 answer
Store array in vector
C++
0 vote241 views1 answer
Iteraate through a vector
C++
0 vote223 views1 answer
Unknown number of threads cpp
C++
0 vote244 views3 answers
Tower of hanoi
C++
0 vote243 views1 answer
SDL_BlitSurface
C++
1 vote219 views1 answer
Union cpp
C++
0 vote236 views1 answer
Bitwise operator in C++ example programs
C++
1 vote224 views1 answer
How to iterater map of sets in c++
C++