title: Pop max value from a heapq python, Is there a max-heap in Python?
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/2501457/what-do-i-use-for-a-max-heap-implementation-in-python">What do I use for a max-heap implementation in Python?</a>  </p>
  </blockquote>
  
  
  
  <p>I am trying to implement in some way the heapq of python but for a max-heap. A solution is using the (-1) and multiple with numbers of the queue but that doesn't help me as I need to store urls in the heap. So i want a max heapq where i can pop the largest value.</p>