BETA

Difficulty Level:

Basic

Total Submissions: 485 Accuracy:

26.8%

Stable Sort and Position
       

Given an array of n integers which may contain duplicate elements, index of an element of this array is given to us, We need to find the final position of this element ( for which the index is given) in the array after stable sort is applied on the array. 

Input:
The first line of input contains an integer T denoting the number of test cases. Each test case contains two integers n and idx. Next line contains space separated n elements in the array a[].

Output:
Print the index(0 based indexing) of the element after a stable sort operation. 

Constraints:
1<=T<=200
1<=n<=1000
0<=idx 1<=a[i]<=10000

Example:
Input:

1
10 5
3 4 3 5 2 3 4 3 1 5

Output:
4

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Shashwat Jain

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.