1972.cpp

HDOJ acm.hdu.edu.cn 第10卷的一些题目

//1972
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;
const int NMAX = 100 +10;
struct node {
	int idx;
	int prio;
};
int ap[NMAX];
int main() {
	int i,j,cas,n,m,ans;
	scanf("%d",&cas);
	while (cas --) {
		scanf("%d %d",&n,&m);
		queue<node> sq;
		for (i=0;i<n;i++) {
			node nt;
			scanf("%d",&nt.prio);
			ap[i] = nt.prio;
			nt.idx = i;
			sq.push(nt);
		}
		sort(ap,ap+n,greater<int>());
		ans = 0;
		i = 0;
		while (!sq.empty()) {
			node now = sq.front();
			sq.pop();
			if (now.prio == ap[i]) {
				ans ++;
				i ++;
				if (now.idx == m) break;
			}
			else sq.push(now);
		}
		printf("%d\n",ans);
	}
}