/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 vote176 views1 answer
Switch in c++
C++
0 vote161 views1 answer
Flowchart to display factors of a number
C++
3 votes161 views1 answer
How to convert qt string to string
C++
0 vote171 views1 answer
Surf interpolation matlab
C++
1 vote146 views1 answer
Cheak a number is positive are negative in c ++ in loop
C++
3 votes182 views1 answer
C++ initialize array with all zeros
C++
1 vote149 views1 answer
C++ builder
C++
0 vote193 views1 answer
Search a word in cpp file
C++
0 vote181 views1 answer
Which version c++ single file in sublime is
C++
1 vote165 views1 answer
Sort a vector of strings according to their length c++
C++