#include <string>
#include <vector>
#include <queue>
using namespace std;
int solution(vector<int> priorities, int location) {
int answer = 0;
int i,j,k;
bool check = false;
bool out_check=false;
queue<int> list;
queue<int> num;
int out[110]={0,};
int out_size=0;
for(i = 0;i < priorities.size();i++)
{
list.push(priorities[i]);
num.push(i);
}
while(1)
{
check=false;
out_check=true;
for(i = 0; i < priorities.size();i++)
{
out_check=true;
for(j = 0;j < out_size;j++)
{
if(i == out[j])
{
out_check=false;
break;
}
}
if(list.front()<priorities[i]&&out_check)
{
list.push(list.front());
list.pop();
num.push(num.front());
num.pop();
check = true;
break;
}
}
if(!check)
{
answer++;
if(num.front()==location)
{
break;
}
out[out_size]=num.front();
out_size++;
num.pop();
list.pop();
}
}
return answer;
}