Coodechef Uncle Johny Problem Code: JOHNY Solution

Solution in C++:
///**********ALLAH IS ALMIGHTY************///
///AH Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int n,ar[1000],i,t,s,k,f,j;
    cin>>t;
    for(j=1; j<=t; j++)
    {
        cin>>n;
        for(i=0; i<n; i++)
            cin>>ar[i];
        cin>>k;
        s=ar[k-1];
        sort(ar,ar+n);
        for(i=0; i<n; i++)
        {
            if(ar[i]==s)
            {
                f=i;
            }
        }
        cout<<f+1<<endl;
    }
}