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 vote112 views1 answer
Get input for array of unknown length/size in c++
C++
0 vote113 views1 answer
How to convert int to FString c++ ue4
C++
2 votes116 views1 answer
Dangling Pointer
C++
0 vote111 views1 answer
Find N Unique Integers Sum Up to Zero
C++
0 vote113 views1 answer
Creating node in c++
C++
9 votes159 views3 answers
Throw exception c++
C++
5 votes117 views6 answers
If arduino
C++
0 vote105 views1 answer
Fname from FString
C++
5 votes270 views2 answers
How to sort a string alphabetically in c++
C++
0 vote119 views1 answer
C++ hello world linux
C++