Sicily1443—— Printer Queue
来源:互联网 发布:gta5官网开放mac版 编辑:程序博客网 时间:2024/09/21 09:25
1443. Printer Queue
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
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, thenmove J to the end of the queue without printing it.
- Otherwise, print job J (and do not put it back in the queue).
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 linewith 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
- Sicily1443—— Printer Queue
- 12100—Printer Queue
- poj3125——Printer Queue
- 这周的一道程序设计题兼sicily1443 Printer Queue题解
- 算法学习【13】—— 1443. Printer Queue
- Printer Queue
- Printer Queue
- Printer Queue
- Printer Queue
- queue队列-printer queue
- 有关优先对列的题——UVA12100 - 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
- UITableView 自带编辑删除
- Android Handler详细使用方法实例
- lua CRC32校验码生成
- 神经网络机器翻译Neural Machine Translation(4): Modeling Coverage & MRT
- UE4 调试着色器编译过程
- Sicily1443—— Printer Queue
- 欢迎使用CSDN-markdown编辑器
- 第10周 C语言及程序设计提高例程-38 main函数的参数
- 【bzoj3653】【谈笑风生】【dfs序+主席树】
- PCM性质
- C#Thread的Interrupt方法
- Nginx ----- Windows下Nginx的安装与部署
- iOS 基础篇3—手写控件,frame,center和bounds属性
- 利用adb 命令回到手机端某个app的页面