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 vote226 views1 answer
Print linked list recursively c++
C++
0 vote181 views1 answer
3. The method indexOf, part of the List interface, returns the index of the first occurrence of an object in a List. What does the following code fragment do?
C++
4 votes270 views1 answer
Arduino uno hello world
C++
0 vote180 views1 answer
How to find size of int array in c++
C++
0 vote177 views1 answer
Sleep system function linux c++
C++
0 vote197 views1 answer
C++ with SVD
C++
8 votes210 views5 answers
Resize vector c++
C++
0 vote171 views7 answers
C++ convert to assembly language
C++
0 vote169 views1 answer
Reading package lists... Done Building dependency tree Reading state information... Done mysql-server is already the newest version (5.7.36-0ubuntu0.18.04.1). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.
C++
12 votes186 views3 answers
How to get input in cpp
C++