POJ 3125 Printer Queue
来源:互联网 发布:sql server 2005 xp版 编辑:程序博客网 时间:2024/04/30 09:35
Printer Queue
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 5001 Accepted: 2600
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).
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 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
3
1 0
5
4 2
1 2 3 4
6 0
1 1 9 1 1 1
Sample Output
1
2
5
题解:将第一个放到末尾,直到第一个数为队列中最大的数删除并计数加一,若这个数是要找的数就跳出循环;
#include <bits/stdc++.h>using namespace std;struct node{ int id; int va;};int main (){ int T,n,m; cin>>T; while(T--&&cin>>n>>m) { queue<node>q; priority_queue<int>qq; node w; int a; for (int i=0; i<n; i++) { scanf("%d",&a); w.id=i; w.va=a; qq.push(a); q.push(w); } int t=0; while(!q.empty()) { w=q.front(); q.pop(); int max=qq.top(); if(w.id==m&&w.va==max) { t++; printf("%d\n",t); break; } if(w.va==max) qq.pop(),t++; else q.push(w); } } return 0;}
- poj 3125 Printer Queue
- POJ 3125 Printer Queue
- Printer Queue(poj 3125)
- poj 3125 Printer Queue
- POJ 3125 Printer Queue
- POJ 3125 Printer Queue 笔记
- POJ 3125 Printer Queue (priority queue)
- POJ 3125 Printer Queue 模拟队列
- poj 3125 Printer Queue (队列)
- POJ 3125 Printer Queue(单链表)
- POJ 3125 Printer Queue 数据结构 队列
- poj 3125.Printer Queue
- POJ 3125 && Sicily 1443 Printer Queue(模拟/队列)
- POJ 3125 && Sicily 1443 Printer Queue(模拟/队列)
- POJ 3125 Printer Queue【简单模拟a打印队列】
- POJ 3125 Printer Queue(打印队列---模拟)
- POJ 3125 Printer Queue(用队列模拟过程)
- Printer Queue
- 关于回调CallBack
- [Unity] RenderTexture上不显示粒子
- LWM2M协议调研
- 设计模式之六大原则——迪米特法则(LoD,LKP)
- 二叉树的建立、遍历等相关操作
- POJ 3125 Printer Queue
- 51nod 1116 K进制下的大数 利用同余式的乘法传递性质
- LWM2M开源协议栈——wakaama源代码分析
- java 数组的学习
- Nginx反向代理通过域名无法访问项目的解决办法
- VS2015在x86平台下找不到包含目录的问题
- 为git配置代理
- 翁恺老师第二周作业
- 1061. Dating (20)