Priority queue in python

I found a plain list with a 2-cut insert like this

lo = 0
        hi = len(a)
        while lo < hi:
            mid = (lo+hi)/2
            if prioityOfx > prioityOfa[mid]: hi = mid
            else: lo = mid+1
        a.insert(lo, x) 

is fastest as i know.
much faster than using heapq. so become the first one. its bottleneck seems to be this insert operation.