title: What is the best way to keep a sorted list in Python
body: <p>I want to keep a sorted list in Python. I will be inserting elements in the list in sorted order. I am aware of the bisect module. However, using a regular python list means shifting all elements to the right when I insert an element. I would like to avoid this performance hit. Neither do I want to resort the list with sorted() every time an element is inserted. Is there a data structure similar to Guava's (Java) TreeMultiset in Python?</p>