/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

2 votes216 views2 answers
Random number generator c++ between 0 and 1
C++
1 vote233 views1 answer
Joining two vectors in c++
C++
0 vote203 views1 answer
MPI_PUT
C++
2 votes229 views1 answer
Insert element in array c++
C++
0 vote268 views1 answer
Grep xargs sed
C++
3 votes224 views5 answers
Round double to 2 decimal places c++
C++
0 vote228 views1 answer
Print hola mundo
C++
3 votes225 views1 answer
Initializing 2d vector
C++
0 vote226 views1 answer
Less than operator overloading in c++
C++
0 vote220 views1 answer
Advanced c++ topics
C++