Kth smallest element

//  Kth smallest element
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int t; cin >> t;
    while(t--){
        int n; cin >> n;
        int a[n], i;
        for(i = 0; i < n; i++) cin >> a[i];
        int k; cin >> k;
        k--;
        nth_element(a, a+k, a+n);
        cout << a[k]<< endl;
    }
}