[STL]Priority Queue (eden)优先级队列
来源:互联网 发布:网络接口 fc 编辑:程序博客网 时间:2024/05/01 00:14
Descrption
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 Format
One line with a positive integer: the number of test cases (at most 20). 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 ≤ 50) 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 Format
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.
Input Sample
31 054 21 2 3 46 01 1 9 1 1 1
Output Sample
125
Hint
建议尝试使用priority queue
出题人:某师兄
Submission
#include <iostream>#include <queue>using namespace std;int main(){ int count; cin>>count; while(count--){ queue<int> q; priority_queue<int> p; int size,index; cin>>size>>index; for(int i=0;i<size;i++){ int ele; cin>>ele; p.push(ele); q.push(ele); } while(1){ if(p.top()!=q.front()){ q.push(q.front()); q.pop(); index--; if(index<0) index=q.size()-1; } else{ p.pop(); q.pop(); if(!index) break; index--; } } cout<<size-q.size()<<endl; } return 0;}
- [STL]Priority Queue (eden)优先级队列
- 优先级队列 priority queue
- Priority Queue 优先级队列
- 优先级队列(Priority Queue)
- STL之heap与优先级队列Priority Queue详解
- STL-优先队列(priority queue)
- 优先级队列(priority——queue)
- 【STL学习】优先级队列Priority Queue详解与C++编程实现
- STL之优先队列priority queue
- Cloud Design Pattern - Priority Queue Pattern(优先级队列模式)
- stl priority queue
- priority queue 优先队列
- priority queue 优先队列
- 优先队列priority queue
- STL学习笔记-priority quene容器(优先级队列)
- C++ Priority Queue(优先队列)
- 优先队列(Priority Queue)
- 优先队列(priority queue)
- 汇编语言 实验12 编写0号中断的处理程序
- 利用网线在两台电脑之间传输文件
- 用SQL Server编写一个存储过程
- 菜鸟学php扩展 之 实战如何在扩展里调第三方函数(标准库/原生/自己写的)(六)
- HDU1002
- [STL]Priority Queue (eden)优先级队列
- 数组:数组中重复的数字
- 欢迎使用CSDN-markdown编辑器
- qduoj ycb与取款机(水题)
- Java基础应用之运算符(用三元运算符判断奇数和偶数)
- Spark性能调优(四)
- qduoj 这题别看了,跳过吧(深搜)
- github简单的几条命令
- qduoj 别骂了,不会让你爆零的(思维)