BZPOPMIN key [key …] timeout

Time complexity: O(log(N)) with N being the number of elements in the sorted set.

It is the blocking version because it blocks the connection when there are no members to pop from any of the given sorted sets. A member with the lowest score is popped from first sorted set that is non-empty, with the given keys being checked in the order that they are given.

See the for the exact semantics, since BZPOPMIN is identical to with the only difference being the data structure being popped from.

*Examples