UVA - 12100 Printer Queue （队列）

题目链接

The only printer in the computer science students’ union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in the printer queue and you may have to wait for hours to get a single page of output. Because some jobs are more important than others, the Hacker General has invented and implemented a simple priority system for the print job queue. Now, each job is assigned a priority between 1 and 9 (with 9 being the highest priority, and 1 being the lowest), and the printer operates as follows.
• The first job J in queue is taken from the queue.
• If there is some job in the queue with a higher priority than job J, then move J to the end of the queue without printing it.
• Otherwise, print job J (and do not put it back in the queue).
In this way, all those important muffin recipes that the Hacker General is printing get printed very quickly. Of course, those annoying term papers that others are printing may have to wait for quite some time to get printed, but that’s life. Your problem with the new policy is that it has become quite tricky to determine when your print job will actually be completed. You decide to write a program to figure this out. The program will be given the current queue (as a list of priorities) as well as the position of your job in the queue, and must then calculate how long it will take until your job is printed, assuming that no additional jobs will be added to the queue. To simplify matters, we assume that printing a job always takes exactly one minute, and that adding and removing jobs from the queue is instantaneous.

Input
One line with a positive integer: the number of test cases (at most 100). Then for each test case:
• One line with two integers n and m, where n is the number of jobs in the queue (1 ≤ n ≤ 100) and m is the position of your job (0 ≤ m ≤ n − 1). The first position in the queue is number 0, the second is number 1, and so on.
• One line with n integers in the range 1 to 9, giving the priorities of the jobs in the queue. The first integer gives the priority of the first job, the second integer the priority of the second job, and so on.

Output
For each test case, print one line with a single integer; the number of minutes until your job is completely printed, assuming that no additional print jobs will arrive.

一看题，正好是符合队列queue的操作，简单上手就是码，由于刚开始的序号不会一直保存也没有办法更新，所以使用结构体队列，结构体存放两个值，分别是编号和权值

明确操作步骤：

1.如果当前队首的序号不是我们需要打印的序号，就再去判断后面是否有权值比它还大的，如果有就不能打印，移到队尾，如果没有就ans++

2.如果当前队首的序号是我们需要打印的，就直接判断后面有没有权值大的，如果有就移到队尾，否则就打印我们需要的，break退出循环

代码：

#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
struct print{
    int id,num;
}p[105];
queue<print> q; ///由于下面函数需要，就定义为全局变量
bool searchBehind(){
    queue<print> Q=q;
    int maxn=-1;
    int num1=Q.front().num;
    Q.pop();
    while(!Q.empty()){
        maxn=max(Q.front().num,maxn);
        Q.pop();
    }
    if(num1>=maxn) return false;
    else return true;
}
int main()
{
    int T,n,k;
    cin>>T;
    while(T--){
        while(!q.empty()) q.pop(); ///清空队列
        cin>>n>>k;
        for(int i=0;i<n;i++){
            cin>>p[i].num;
            p[i].id=i;
            q.push(p[i]);
        }
        if(n==1){
            cout<<1<<endl;
            continue;
        }
        int ans=1;
        while(1){ ///主要循环
            if(q.front().id!=k){
                if(searchBehind()){
                    q.push(q.front());
                    q.pop();
                }else{
                    q.pop();
                    ans++;
                }
            }else{
                if(searchBehind()){
                    q.push(q.front());
                    q.pop();
                }else break;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}