uva12100（打印队列）

#include<queue>
#include<vector>
#include<string>
#include<iostream>
#include<algorithm>
#include <functional>
using namespace std;
#define MAXN 1000

int main() {
	int T;
	int time = 0;
	int n, d,temp;
	cin >> T;
	while (T--) {
		deque<int> q;
		deque<int> q1;
		time = 0;
		
		cin >> n >> d;
		for (int i = 0; i < n; i++) {//存放数据
			cin >> temp;
			q.push_back(temp);
			q1.push_back(temp);
		}
		sort(q1.begin(), q1.end(),greater<int>());
	
		for (int i = 0; i < q.size(); i++) {//找出有几个比给定值大
			if (q[d] < q1[i]) {
				time++;
				
			}
		}
		for (int i = 0; i <time; i++) {
			for (int j = 0; j < q.size(); j++) {
				if (d - 1 < 0) {
					d = q.size()-1;
				}else {
					d -= 1;
				}
				if (q[0] == q1[i]) {
					q.pop_front();
					q1.pop_front();
					break;
				}
				else {
					q.push_back(q.front());
					q.pop_front();
				}
				
			}
		}
		
		
		for (int i = 0; i <= d; i++) {
			if (q[i] == q[d]) {
				time++;
			}
		}
		cout <<time<< endl;
	}

}