暑期集训1:C++STL 例3:UVA-12100

2018学校暑期集训第一天——C++与STL

例三 —— UVA - 12100

Printer Queue

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 ﬁrst 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 muﬃn 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 ﬁgure 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
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 ﬁrst 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 ﬁrst integer gives the priority of the ﬁrst 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 <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
using namespace std;int main(void)
{int n, m, t, aim;priority_queue<int> pq;queue<int> q;scanf("%d", &t);while (t--) {scanf("%d%d", &n, &m);aim = m;int x;for (int i = 0; i < n; i++) {scanf("%d", &x);pq.push(x);q.push(x);}int ans = 0;while (true) {int front = q.front(), top = pq.top();q.pop();if (front < top) {q.push(front);if (aim == 0)aim = (int)q.size() - 1;elseaim--;} else {ans++;pq.pop();if (aim == 0) {printf("%d\n", ans);break;} else {aim--;}}}while (!pq.empty()) {pq.pop();}while (!q.empty()) {q.pop();}}return 0;
}

注：此题主要考察优先队列

暑期集训1:C++STL 例3:UVA-12100相关推荐

暑期集训1:C++STL 例1:UVA-10815
2018学校暑期集训第一天--C++与STL 例一 -- UVA - 10815 Andy's First Dictionary Description XY学长刚刚立下了再不过CET就直播xx的 ...
暑期集训1:C++STL 例2:UVA-10935
2018学校暑期集训第一天--C++与STL 例二 -- UVA - 10935 Throwing cards away I Given is an ordered deck of n cards ...
暑期集训1:C++STL 练习题E:POJ-2431
2018学校暑期集训第一天--C++与STL 练习题E -- POJ - 2431 E - 二律背反的对偶 A group of cows grabbed a truck and ventured ...
暑期集训1:C++STL 练习题D:HDU-1509
2018学校暑期集训第一天--C++与STL 练习题D -- HDU - 1509 D - 振电迁移的日蚀 Message queue is the basic fundamental of win ...
暑期集训1:C++STL 练习题C:HDU-1263
2018学校暑期集训第一天--C++与STL 练习题C -- HDU - 1263 C - 亡失流转的孤独夏天来了~~好开心啊,呵呵,好多好多水果~~ Joe经营着一个不大的水果店.他认为生存 ...
暑期集训1:C++STL 练习题B:HDU-1004
2018学校暑期集训第一天--C++与STL 练习题B -- HDU - 1004 B - 双对福音的协议 Contest time again! How excited it is to see ...
暑期集训1:C++STL 练习题A:POJ-1833
2018学校暑期集训第一天--C++与STL 练习题A -- POJ-1833 A - 闭时曲线的引言 Time Limit: 1000MS Memory Limit: 30000K Total ...
暑期集训4:栈,树,优先队列例 : UVA - 514
2018学校暑期集训第四天--栈,树,优先队列例题 -- UVA - 514 Rails There is a famous railway station in PopPush City. ...
暑期集训2:ACM基础算法例2:POJ-2456
2018学校暑期集训第二天--ACM基础算法例二 -- POJ - 2456 Aggressive cows Farmer John has built a new long barn, wi ...

暑期集训1:C++STL 例3:UVA-12100

Printer Queue

暑期集训1:C++STL 例3:UVA-12100相关推荐

最新文章

热门文章