结构体应用 + 队列

#include<bits/stdc++.h>
using namespace std;
struct node{
	int pri;
	int f;
}rt;
int a[5555];
int cmp(int a,int b){
	return a>b;
}
int main(){
	int t,n,m;
	{
		cin>>n>>m;
		queue<node>q;
		for(int i=0;i<n;i++){
			cin>>rt.pri;
			if(i==m)rt.f=1;
			else rt.f=0;
			a[i]=rt.pri;
			q.push(rt);
		}
		sort(a,a+n,cmp);
		int ans=0,tp=0;
		while(q.size()){
			rt=q.front();
			q.pop();
			if(a[tp]==rt.pri){
				tp++;
				ans++;
				if(rt.f==1){
					printf("%d\n",ans);	
					break;
				}

			}else q.push(rt);
		}
	}
}