#include <bits/stdc++.h>
using namespace std;
void kLargest(int arr[], int n, int k)
{
sort(arr, arr + n, greater<int>());
for (int i = 0; i < k; i++)
cout << arr[i] << " ";
}
int main()
{
int arr[] = { 1, 23, 12, 9, 30, 2, 50 };
int n = sizeof(arr) / sizeof(arr[0]);
int k = 3;
kLargest(arr, n, k);
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIGtMYXJnZXN0KGludCBhcnJbXSwgaW50IG4sIGludCBrKQp7Cgpzb3J0KGFyciwgYXJyICsgbiwgZ3JlYXRlcjxpbnQ+KCkpOwoKCmZvciAoaW50IGkgPSAwOyBpIDwgazsgaSsrKQpjb3V0IDw8IGFycltpXSA8PCAiICI7Cn0KCgppbnQgbWFpbigpCnsKaW50IGFycltdID0geyAxLCAyMywgMTIsIDksIDMwLCAyLCA1MCB9OwppbnQgbiA9IHNpemVvZihhcnIpIC8gc2l6ZW9mKGFyclswXSk7CmludCBrID0gMzsKa0xhcmdlc3QoYXJyLCBuLCBrKTsKfQoK