title: Priority queue random access
body: <p>I have priority queue which sorts elements by some value(lets name it rating). I need to take elements from queue by rating. So i need to implement function queue_get(rating). This function also increases rating which is okay with priority heap.</p>
  
  <p>But problem is that each level of the heap is not ordered by rating. Elements of each level only satisfy the heap property. So I could not surely return N-th element by rating.</p>
  
  <p>Are there any implementations of priority queue with such functionality?
  Should I use another data structure?</p>