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 vote261 views2 answers
Or in c++
C++
0 vote259 views1 answer
2000pp pp play osu std
C++
0 vote257 views1 answer
Phi function
C++
0 vote274 views1 answer
How to scan array in c++
C++
0 vote304 views1 answer
For statement in c++
C++
19 votes279 views3 answers
Segmentation fault (core dumped)
C++
0 vote300 views1 answer
Export gcc g++
C++
0 vote262 views1 answer
How to increase array memory in c++
C++
0 vote253 views1 answer
Default rule of five c++
C++
0 vote234 views1 answer
1ll
C++