I need to find a data structure that supports insertion, deletion and finding the median of the elements stored at the data structure.

All the operation should run in O(loglogn)

**time.**

__amortized__Any ideas?

I tried using two heaps so I can find the median in O(1), but I don't thing it's good enough...