Priority Queues

What data structures other than Fibonacci heaps and queaps can handle
constant time inserts and O(log N) extract min? I'm looking for one
that's intuitive and easy to implement. If there isn't any such data
structure, is it non-existant because it is non-trivial to conjure up
one?

Thanks,
Lauren

.