Now suppose that the order of the array was important. Design and implement an algorithm that returns an array of the k largest elements of A in their original order, and it should run in () time. Please do not use Python's library for sort. do not use A.sort(reverse=True) or sth like this.

For example, BiggestInOrder([0,5,1,3,4], 3) should return [5,3,4].