title: Do we have priority queue which supports delete operation with same complexity as other operations?
body: <p>Priority Queue is famous for retrieving max or min element from a set. 
  The two common operations on priority queue are <strong>Insert</strong> and <strong>DeleteMin/DeleteMax</strong>.
  Do we have priority queue which supports <strong>Delete(x)</strong> ?
  The meaning of <strong>Delete(x)</strong> is two <strong>delete the item x from priority queue</strong>.</p>
  
  <p>The naive way to do this is to find item x and delete it, but it will take linear time. I am looking for some better algorithm.  </p>