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 vote285 views1 answer
(1 & 1) in cpp
C++
4 votes305 views1 answer
Gcd of two numbers c++
C++
2 votes301 views1 answer
C++ lambda thread example
C++
1 vote324 views1 answer
Ray sphere intersection equation
C++
0 vote268 views1 answer
C++ code executio canntot proceed because glew32.dll was not founud
C++
1 vote331 views1 answer
C++ until
C++
0 vote296 views1 answer
Oncomponentbeginoverlap ue4 c++
C++
1 vote343 views1 answer
Unique_ptr header file
C++
1 vote303 views1 answer
Eosio get time
C++
0 vote305 views1 answer
Why ostream cannot be constant
C++