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

-2 votes139 views1 answer
Computer vision libraries C++
C++
0 vote141 views1 answer
Extra parameter in comparator function for sort
C++
7 votes132 views1 answer
Convert binary to decimal c++ stl
C++
0 vote133 views1 answer
Cuda locks
C++
0 vote131 views1 answer
C++ remove all elements equal to
C++
0 vote179 views1 answer
Adddynamic ue4 c++
C++
1 vote155 views2 answers
Read comma separated text file in c++
C++
0 vote146 views1 answer
C++ vector push if not exist
C++
0 vote144 views1 answer
Sfml hide message
C++
0 vote121 views1 answer
Modify file CPP
C++