The question is uncle johny - easy section .

#include

#include

#include

using namespace std;

int main() {

int t;

vector v;

cin>>t;

while(t–)

{ int n ;

int j,k;

cin>>n;

int num;

for(j =0;j<n;j++)

{

cin>>num;

v.push_back(num);

}

int pos;

cin>> pos;

int temps = v[pos-1];

```
sort(v.begin(),v.end());
for(j =0;j<n;j++)
{ if(v[j]==temps)
cout<<j+1<<endl;
}
}
return 0;
```

}

this is the solution that i had written and i am unable to understand how to reduce the time limit. thankyou in advance!