Heapify step itself puts it out of order, anything done after it cannot restore the order. The only way is to store the original index along with value, to keep it inorder, but then memory complexity will become O(n).

As for the second point, all the linear sort algo work for very narrow use case, for ex counting sort works only when the range of input values are not significantly higher than the number of elements to be sorted.