k_th_smallest_element.py

class Solution:
    def kthSmallest(self, arr, l, r, k):
        return sorted(arr)[k-1]


# Driver Code
if __name__ == '__main__':
    import random
    t = int(input())
    for tcs in range(t):
        n = int(input())
        arr = list(map(int, input().strip().split()))
        k = int(input())
        ob = Solution()
        print(ob.kthSmallest(arr, 0, n-1, k))