Kth_Smallest_Largest_element_in_array.cpp

#include <bits/stdc++.h>
using namespace std;
vector<int> kthSmallLarge(vector<int> &arr, int n, int k)
{
    vector<int> ans;
    sort(arr.begin(), arr.end());
    ans.push_back(arr[k - 1]);
    ans.push_back(arr[n - k]);
    return ans;
}