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

-1 vote192 views1 answer
How to print items in arduino
C++
3 votes226 views2 answers
Find maximum sum in array of contiguous subarrays
C++
0 vote192 views1 answer
How to define global array in c++ in a scope
C++
0 vote186 views1 answer
Finding no of unique characters in a string c++
C++
0 vote187 views1 answer
Cout stack in c++
C++
0 vote194 views1 answer
Math in section title latex
C++
1 vote146 views1 answer
Add element to start of vector c++
C++
11 votes189 views1 answer
Strcmp different length
C++
0 vote195 views1 answer
Error: use of parameter outside function body before ] token c++
C++
0 vote230 views1 answer
C++ require keyword
C++