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 vote130 views1 answer
Nearly similar rectangles hackerrank solution
C++
0 vote122 views1 answer
Qt insert image in widget
C++
-3 votes158 views1 answer
Array c plus plus
C++
0 vote134 views1 answer
Is vscode better than sublime
C++
12 votes129 views3 answers
C++ vector size
C++
1 vote163 views1 answer
C++ cout format
C++
0 vote128 views1 answer
Find N Unique Integers Sum Up to Zero
C++
5 votes169 views3 answers
Fast io c++
C++
0 vote158 views1 answer
Expresiones regulares español
C++
3 votes88 views2 answers
C++ get data type
C++