2647. Printer Queue
来源:互联网 发布:淘宝女款大衣 编辑:程序博客网 时间:2024/06/05 11:59
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, thenmoveJ 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 importantmuffin 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 simplifymatters, 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.
Sample input
31 054 21 2 3 46 01 1 9 1 1 1
Sample output
125
#include<iostream>#include<algorithm>using namespace std;struct{int p,flag;}c[500];int main(){int t,n,m,a[500],ans;cin>>t;while(t--){cin>>n>>m;for(int i=0;i<n;i++){cin>>a[i];c[i].p=a[i];if(i==m)c[i].flag=1;elsec[i].flag=0;}sort(a,a+n);int head=0,tail=n,top=n-1;ans=0;while(head<tail){int temp=c[head].p,ff=c[head].flag;head++;if(temp!=a[top]){c[tail].p=temp;c[tail].flag=ff;tail++;}else if(ff)break;else{top--;ans++;}}cout<<ans+1<<endl;}return 0;}
- 2647. Printer Queue
- Printer Queue
- Printer Queue
- Printer Queue
- Printer Queue
- queue队列-printer queue
- poj 3125 Printer Queue
- 1443. Printer Queue
- hoj Printer Queue
- sicily--1443. Printer Queue
- POJ 3125 Printer Queue
- Printer Queue打印队列
- sicily 1443 Printer Queue
- poj 3125.Printer Queue
- Sicily 1443. Printer Queue
- HOJ 2654 Printer Queue
- 1443 Printer Queue
- 1443. Printer Queue
- mysql存储过程和函数示例
- Android开发系列(五):Android应用中文件的保存与读取
- 完全分布式Hadoop2.3安装与配置
- 堆排序+代码实现
- 数据库中的一些概念
- 2647. Printer Queue
- C/C++内存对齐
- 程序员的自我修养总结(一)
- codeforces 464C Substitutes in Number
- 2014-9-8 中秋节发福利了
- JSONP跨域获取JSON数据
- 如何配置eclipse中拼写自动联想功能
- eclipse Maven项目搭建 图解
- Reverse Linked List II