as we all known, in the standard module 'heapq', we can easily get the smallest item from the heap. i.e. it's an implementation of min-heap. my question is how to use 'heapq' to extract the biggest item from the heap? is it possible? thanks in advance.:)
-- http://mail.python.org/mailman/listinfo/python-list
