Given an array **arr** and a number **K** where K is smaller than size of array, the task is to find the **K’th smallest** element in the given array. It is given that all array elements are distinct.

**Expected Time Complexity: **O(n)

**Input:**

The first line of input contains an integer **T,** denoting the number of testcases. Then T test cases follow. Each test case consists of three lines. First line of each testcase contains an integer **N** denoting size of the array. Second line contains N space separated integer denoting elements of the array. Third line of the test case contains an integer K.

**Output:**

Corresponding to each test case, print the desired output in a new line.

**Constraints:**

1 <= T <= 100

1 <= N <= 10^{5}

1 <= arr[i] <= 10^{5}

1 <= K <= N

**Example:
Input:**

2

6

7 10 4 3 20 15

3

5

7 10 4 20 15

4

**Output:**

7

15

**Explanation:
Testcase 1:** 3rd smallest element in the given array is 7.

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

:)) | 186 |

Change_UserHandle | 183 |

shivam2303 | 176 |

PankajChhabra1 | 174 |

Boruto_Uzumaki | 136 |

KapilChhipa | 582 |

sagarsagar | 502 |

mb1973 | 475 |

AKASH24497 | 466 |

AmanDeepSingh97 | 465 |

blackshadows | 5254 |

Ibrahim Nash | 5192 |

akhayrutdinov | 5111 |

Quandray | 4385 |

mb1973 | 3912 |

Login to report an issue on this page.