/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

3 votes209 views2 answers
C++ round number to whole
C++
17 votes185 views4 answers
How to reference a child gameobject unity
C++
0 vote161 views1 answer
C++ suare
C++
0 vote154 views1 answer
C++ start thread later
C++
30 votes162 views10 answers
Google translate
C++
0 vote121 views1 answer
Sleep not declared in this scope c++
C++
0 vote156 views1 answer
Person parametr cpp
C++
35 votes177 views6 answers
Hello world cpp
C++
0 vote248 views1 answer
Const char * to std::wstring
C++
0 vote146 views1 answer
#include <stdio.h> cpp
C++