it is clearly O(klogn). We are popping k times from a heap of size n.

		coder007 on March 10, 2017 \| parent \| context \| favorite \| on: Data structures and algorithms problems in C++ usi... it is clearly O(klogn). We are popping k times from a heap of size n.