/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

8 votes338 views3 answers
Initialize all elements of vector to 0 c++
C++
0 vote301 views1 answer
C++ default constructor remove
C++
0 vote326 views1 answer
Glm has no member value_ptr
C++
0 vote333 views1 answer
Store arbitrarly large vector of doubles c++
C++
23 votes311 views6 answers
String to char
C++
1 vote319 views1 answer
Ue4 find component c++
C++
0 vote348 views1 answer
10^18 data type in c++
C++
19 votes295 views1 answer
File objects in c++
C++
0 vote289 views1 answer
Freeing array in c++
C++
1 vote309 views1 answer
Eosio require_find
C++