Breaking News: Grepper is joining You.com. Read the official announcement!

priority queue ordered by second element

Lucky Loris answered on August 21, 2021 Popularity 4/10 Helpfulness 8/10

answer priority queue ordered by second element

priority queue ordered by second element

Comment

#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
    */
}

Popularity 4/10 Helpfulness 8/10 Language cpp

Source: Grepper

Tags: c++ element priority-queue

Link to this answer
Share Copy Link

Contributed on Aug 21 2021

Lucky Loris

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

priority queue ordered by second element

Contents

More Related Answers

priority queue ordered by second element

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.