find the k largest elements in an array using heap code example

Example: K Largest Elements Heap

1. You are given a number n, representing the size of array a.2. You are given n numbers, representing elements of array a.3. You are given a number k.4. You are required to find and print the k largest elements of array in increasing order.