|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Even and odd elements at even and odd positions|
|Immediate Smaller Element|
|Remove every k'th node|
|Maximum of all subarrays of size k|
|Boundary Traversal of binary tree|
Given a array of length N , at each step it is reduced by 1 element for eg. in the first step the maximum element would be removed , in the second step minimum element of the remaining array would be removed , in the third step again the maximum and so on. Continue this till the array contains only 1 element . And print that final element remaining in the array.
The first line contains a single integer T i.e. the number of test cases. The first line of each test case consists of a single integer N . The second and last line of each test case contains the N spaced integers .
Fore each test case in new line print the final remaining element in the array.
7 8 3 4 2 9 5
8 1 2 9 4 3 7 5
Test Case 1:
In first step '9' would be removed, in 2nd step '2' will be removed, in third step '8' will be removed and so on. So the last remaining element would be '5'.