/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 vote194 views1 answer
Google spreadsheets add two strings
C++
0 vote174 views1 answer
Redragon m609 weight
C++
1 vote180 views1 answer
Esp32 restart from code
C++
2 votes166 views1 answer
Qstring mid
C++
0 vote192 views1 answer
Vs_buildtools.exe --norestart --passive --downloadThenInstall --includeRecommended --add Microsoft.VisualStudio.Workload.NativeDesktop --add Microsoft.VisualStudio.Workload.VCTools --add Microsoft.VisualStudio.Workload.MSBuildTools
C++
0 vote220 views1 answer
What is c++ used for
C++
70 votes219 views5 answers
Erase element from vector c++
C++
0 vote220 views1 answer
C create 1 bit value
C++
0 vote177 views1 answer
Kadane algo
C++
4 votes171 views1 answer
Cin statement c++
C++