yes, i am thinking in the same way ,since we have to find the smallest three element then we have to build the min heap first which will take o(n) time and after that we need to delete the smallest no. which will take o(logn) time . like this way we will find out all three smallest number in total (n +logn )time