Untitled

#include <bits/stdc++.h>
using namespace std;

int logic1(int n, int k, int arr[])
{
    int st = 0, en = n - 1;
    sort(arr + st, arr + en);
    return arr[k - 1];
}

int correct(int n, int k, int arr[])
{
    for (int i = 0; i < n; i++)
    {
        int cnt = 0;
        for (int j = 0; j < n; j++)
        {
            if (arr[j] < arr[i])
                cnt++;
        }
        if (cnt == (k - 1))
        {
            return arr[i];
        }
        else
        {
            continue;
        }
    }
}

int get_random(int a, int b)
{
    return a + rand() % (b - a + 1);
}

void generate()
{
    int t = 100;
    while (t--)
    {
        int n, k;
        n = get_random(1, 6);
        k = get_random(1, n);

        int arr[n];
        set<int> st;
        while (st.size() < n)
        {
            int x = get_random(1, 100);
            st.insert(x);
        }
        int index = 0;
        for (auto v : st)
        {
            arr[index++] = v;
        }
        random_shuffle(arr, arr + n);

        cout << "Input generated: \n";
        cout << n << " " << k << endl;
        for (int i = 0; i < n; i++)
        {
            cout << arr[i] << " ";
        }
        cout << endl
             << endl;

        int code_op = logic1(n, k, arr);
        int correct_op = correct(n, k, arr);
        if (code_op != correct_op)
        {
            cout << "FAILING!\n";
            return;
        }
    }
}

void solve()
{
    int n, k;
    cin >> n >> k;
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
    cout << logic1(n, k, arr) << endl;
}

int main()
{
    // generate();
    int t;
    cin >> t;
    while (t--)
        solve();
}