/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

1 vote208 views1 answer
Xmake set exe name
C++
8 votes229 views2 answers
C++ factorial
C++
-1 vote214 views4 answers
How to say hello world in c++
C++
4 votes211 views2 answers
C++ reading string
C++
2 votes209 views1 answer
Getch c++ library
C++
0 vote245 views1 answer
Play audio c++
C++
1 vote205 views1 answer
0009:err:mscoree:CLRRuntimeInfo_GetRuntimeHost Wine Mono is not installed
C++
0 vote201 views1 answer
Split a number and store it in vector
C++
0 vote233 views1 answer
Operand-- c++
C++
0 vote216 views1 answer
Error: 'std::high_resolution_clock' has not been declared
C++