#include <stdio.h>
#define MAX 101
typedef struct {
int num;
int idx;
} File;
int main() {
int t;
scanf("%d",&t);
while(t--) {
int n,m;
scanf("%d %d",&n, &m);
File que[MAX];
int rear=0,front=0;
//입력 받음
for(int i=0; i<n; i++) {
que[rear].idx=i;
scanf("%d",&que[rear].num);
rear=(rear+1)%MAX;
}
int cnt=0;
while(front!=rear) {
int flag=0;
for(int i=(front+1)%MAX; i!=rear; i=(i+1)%MAX) {
if(que[front].num<que[i].num) {
flag=1;
break;
}
}
//뒤에 큰수 잇음
if(flag) {
que[rear]=que[front];
rear=(rear+1)%MAX;
front=(front+1)%MAX;
//젤 큰수임
} else {
cnt++;
if(m==que[front].idx) {
printf("%d\n",cnt);
break;
}
front=(front+1)%MAX;
}
}
}
return 0;
}
To embed this project on your website, copy the following code and paste it into your website's HTML: