Challenge: Find k Largest Elements in an Array

Problem Statement

Implement a function findKLargest(arr,k) that takes an unsorted integer array as input and returns the $k$ largest elements in the array using a max heap. The maxHeap class that was written in a Max Heap (Implementation) is prepended in this exercise so feel free to use it! Have a look at the illustration given for a clearer picture of the problem.

Input

An array containing integers

Output

Returns an integer array containing first k largest elements

Sample Input

arr = [9,4,7,1,-2,6,5]           k = 3

Sample Output

[9,7,6]