K Largest Elements
easy
1. You will be given an Array with its length 2. You will also be given an integral value k 3. You need to find k largest elements from the given array 4. Input is handled for you 5. It is a functional problem ,please do not modify main()
Constraints
1 <= N <= 100 K <= N -1000 <= C[i] <= 1000
Format
Input
Input is handled for you
Output
Output MUST be in descending order
Example
Sample Input
8
44 -5 -2 41 12 19 21 -6
2
Sample Output
44 41