Printer Queue打印队列
来源:互联网 发布:淘宝如何选择发货地 编辑:程序博客网 时间:2024/05/17 08:21
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.
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.
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.
31 054 21 2 3 46 01 1 9 1 1 1
125
我的解法:
#include <iostream>
#include <vector>
using namespace std;
struct jobs
{
int flag; // 1表示目标job,其他为0
int contant; //优先级
};
int main()
{
int num;
cin>>num;
for(int x=0;x<num;x++)
{
int numOfJob,pos;
int count=1;
cin>>numOfJob>>pos; //读取队列长度和目标文档的位置
vector<jobs> q;
int priority;
jobs temp;
for(int i=0;i<numOfJob;i++) //读取优先级队列
{
cin>>priority;
temp.contant=priority;
temp.flag=0;
q.push_back(temp);
}
q[pos].flag =1; //把目标的flag设为1
bool state=true;
while(state)
{
int maxPos=0;
int maxNum=q[0].contant;
for(int j=0;j<q.size();j++) //寻找优先级最大的文档的位置
{
if(q[j].contant >maxNum)
{
maxNum=q[j].contant;
maxPos=j;
}
}
jobs tempjob;
for(int k=0;k<maxPos;k++) //把优先级最大的文档排到第一位,之前的文档按顺序排到队尾
{
tempjob.contant =q[0].contant;
tempjob.flag =q[0].flag;
q.erase(q.begin());
q.push_back(tempjob);
}
if((*q.begin()).flag !=1) //如果优先级最大的文档不是目标文档,移除,计数器加一
{
q.erase(q.begin());
count++;
}
else
{
state =false; //如果是的话结束循环
}
}
cout<<count<<endl;
q.empty();
}
return 0;
}
- Printer Queue打印队列
- 打印队列(Printer Queue)
- UVa12100 Printer Queue (打印队列)
- UVA12100:Printer Queue(打印队列)
- Printer Queue(打印队列)POJ3125
- Printer Queue 打印队列 UVA 12100
- uva 12100 Printer Queue(打印队列)模拟
- queue队列-printer queue
- POJ 3125 Printer Queue【简单模拟a打印队列】
- POJ 3125 Printer Queue(打印队列---模拟)
- 5-7 UVA 12100 Printer Queue打印队列
- 习题5-7 打印队列(Printer Queue, UVa12100)
- UVA 12100 Printer Queue(队列,优先队列)
- uva 12100 Printer Queue 习题5-7 打印队列 (STL deque练习)
- 关于“打印队列 Printer Queue, ACM/ICPC NWERC 2006, UVa 12100)"的讨论
- 算法竞赛入门经典 第二版 习题5-7 打印队列 Printer Queue uva12100
- 1443.Printer Queue 基本队列操作
- POJ 3125 Printer Queue 模拟队列
- CodeSign error: code signing is required for product type Application in SDK iOS 4.2
- 李开复:VC看不上你的五个原因
- C#变量的命名
- 设计模式:模板模式
- JQuery+radio相关操作
- Printer Queue打印队列
- Ubuntu 12.04 中安装和配置 Java JDK
- Android OpenGL基础教程 1
- Shortcuts removal fails on Windows Vista
- Android开发:如何实现TCP和UDP传输
- ffmpeg对ts流的解析
- 卡西欧(casio)-SGW-100 磁偏角矫正(电子指南针数码罗盘矫正)
- 求2~2000的所有素数.有足够的内存,要求尽量快
- iOS 6 Secure密码UITextField造成非密码UITextField退格清空Bug