On Thu, Sep 1, 2016 at 3:34 PM, Paolo Bolzoni <paolo.bolzoni.brown@gmail.com> wrote:

Oh, dear. I made a stupid mistake. I meant a "priority deque", a data
structure where you can easily access the maximum and minimum element.
In priority queue you can top and pop the maximum element, I would
need both to pop and top the maximum and the minimum.