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 vote204 views1 answer
Unordered_map header file c++
C++
0 vote189 views1 answer
C++ program to print natural numbers from 1 to 10 in reverse order using while loop
C++
0 vote203 views10 answers
Convert java code to c++ online
C++
1 vote202 views1 answer
C++ vector decimal to binary
C++
19 votes190 views1 answer
Dev c++
C++
0 vote169 views1 answer
Can you assign a value to a deleted pointer
C++
3 votes195 views1 answer
Cpp boilerplate
C++
0 vote196 views1 answer
Pros millis()
C++
1 vote219 views1 answer
Get a string from file in c++
C++
0 vote211 views1 answer
Assignment of single field in struct in solidity
C++