Answers for "inversed priority queue"

C++
0

inversed priority queue

//Creating an alias
template<class T> using min_heap = priority_queue<T, std::vector<T>, std::greater<T>>;

//Declaration
min_heap<int> my_heap;
Posted by: Guest on March-26-2022

Browse Popular Code Answers by Language