熟悉STL中队列的使用。
//#define LOCAL
#include<iostream>
#include<queue>
using namespace std;
pair<int, int> p[105],p1;
queue<pair<int, int>> q;
priority_queue<int> q1;
int minute;
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int T;
int n, m;
cin >> T;
while (T--){
minute = 0;
p1.second = -10;
while (!q.empty()) q.pop();
while (!q1.empty()) q1.pop();
cin >> n >> m;
for (int i = 0; i < n; i++){
cin >> p[i].first; p[i].second = i;
q.push(p[i]);
q1.push(p[i].first);
}
for (;;){
if ((q.front()).first < q1.top()){
q.push(q.front());
q.pop();
}
else{
p1 = q.front();
q.pop();
q1.pop();
minute++;
}
if (p1.second== m){
cout << minute << "\n";
break;
}
}
}
return 0;
}