Comparator priority queue c++

How to use comparator funtion in priority queue in c++

// suppose you want to apply comparator on pair <int, string>
// declaration of priority queue
priority_queue<pair<int, string>, vector<pair<int, string>>, myComp> pq;
// here myComp is comparator
struct myComp {
  bool operator()(
    pair<int, string>& a,
    pair<int, string>& b)
  {
    return a.first > b.first;
    // can write more code if required. depends upon requirement.
  }
};

Comparator priority queue c++

struct CompareHeight {
    bool operator()(Person const& p1, Person const& p2)
    {
        // return "true" if "p1" is ordered
        // before "p2", for example:
        return p1.height < p2.height;
    }
};

Source: geeksforgeeks.org

Similar codes

0 vote221 views1 answer
I++ and++i
C++
0 vote219 views1 answer
Bash script add another user
C++
3 votes208 views2 answers
A+b+c whole square
C++
-1 vote213 views1 answer
Easy c++ code
C++
0 vote216 views1 answer
Set width qpushbutton
C++
1 vote210 views1 answer
Meter espacios en cadena c
C++
2 votes216 views3 answers
C++ lambda
C++
3 votes203 views2 answers
C++ round number to whole
C++
0 vote243 views1 answer
Three way comparison operator c++
C++
1 vote221 views1 answer
STD::ERASE FUNCTION IN C++
C++