| 23 | using std::priority_queue<T, Container, Compare>::priority_queue; |
| 24 | |
| 25 | T pop_move() { |
| 26 | T item = std::move(this->c.front()); |
| 27 | std::pop_heap(this->c.begin(), this->c.end(), this->comp); |
| 28 | this->c.pop_back(); |
| 29 | return item; |
| 30 | } |
| 31 | |
| 32 | void pop() = delete; |
| 33 | }; |