http://acm.hdu.edu.cn/showproblem.php?pid=1972
按优先级打印队列元素,到目标元素所需时间
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <iostream>
#include <sstream>
#include <algorithm>
using namespace std;
#define RD(x) scanf("%d",&x)
#define RD2(x,y) scanf("%d%d",&x,&y)
#define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define clr0(x) memset(x,0,sizeof(x))
#define clr1(x) memset(x,-1,sizeof(x))
typedef long long LL;
const int maxn = 2e5+8;
const int inf = 1e9+7;
struct node{
int pr,x;
bool v;
}job[105];
queue<node> q;
int ans = 0,n,m;
bool check(node c)
{
for(int i = 0;i < n;++i){
if(!job[i].v && job[i].pr > c.pr)
return false;
}
return true;
}
void work()
{
node i;
i.x = -1;
while(i.x != m){
i = q.front();
q.pop();
while(!check(i)){
q.push(i);
i = q.front();
q.pop();
}
job[i.x].v = true;
ans++;
}
}
int main()
{
int _,x;
RD(_);
while(_--){
RD2(n,m);
while(!q.empty())q.pop();ans = 0;
for(int i = 0;i < n;++i){
RD(x);
q.push((node){x,i,false});
job[i] = (node){x,i,false};
}
work();
printf("%d\n",ans);
}
}