Devise a heap-sorting-based algorithm for finding the k smallest positive elements of an unsorted set of n-element array. Discuss the expected analytical time-complexity! (Show your work; the time complexity for heap-building must be included; it is assumed that 50% of elements are positive)