POJ - 3481 - Double Queue (STL)
来源:互联网 发布:js字符串转时间日期 编辑:程序博客网 时间:2024/06/13 09:05
Description
The new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment provided by IBM Romania, and using modern information technologies. As usual, each client of the bank is identified by a positive integer K and, upon arriving to the bank for some services, he or she receives a positive integer priority P. One of the inventions of the young managers of the bank shocked the software engineer of the serving system. They proposed to break the tradition by sometimes calling the serving desk with the lowest priority instead of that with the highest priority. Thus, the system will receive the following types of request:
0The system needs to stop serving1 K PAdd client K to the waiting list with priority P2Serve the client with the highest priority and drop him or her from the waiting list3Serve the client with the lowest priority and drop him or her from the waiting listYour task is to help the software engineer of the bank by writing a program to implement the requested serving policy.
Input
Each line of the input contains one of the possible requests; only the last line contains the stop-request (code 0). You may assume that when there is a request to include a new client in the list (code 1), there is no other request in the list of the same client or with the same priority. An identifier K is always less than 106, and a priority P is less than 107. The client may arrive for being served multiple times, and each time may obtain a different priority.
Output
For each request with code 2 or 3, the program has to print, in a separate line of the standard output, the identifier of the served client. If the request arrives when the waiting list is empty, then the program prints zero (0) to the output.
Sample Input
21 20 141 30 321 10 993220
Sample Output
02030100
Source
AC代码:
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <map>using namespace std;int main() {int f;map<int, int> mp;while(scanf("%d", &f) == 1 && f != 0) {int client, pri;if(f == 1) {scanf("%d %d", &client, &pri);mp[pri] = client;} else if(f == 2) {if(mp.empty()) {printf("0\n");continue;}map<int, int> :: iterator it = --mp.end();printf("%d\n", it->second);mp.erase(it->first);} else if(f == 3) {if(mp.empty()) {printf("0\n");continue;}map<int, int> :: iterator it = mp.begin();printf("%d\n", it->second);mp.erase(it->first);}}return 0;}
- POJ - 3481 - Double Queue (STL)
- POJ 3481 Double Queue(STL)
- POJ 3481 Double Queue (STL SET)
- POJ 3481 Double Queue(STL)
- POJ 3481 Double Queue(STL)
- POJ 3481 Double Queue(STL)
- POJ 3481 Double Queue(STL之双向优先队列)
- [poj 3481]Double Queue[set || map][STL]
- poj 3481 Double Queue(使用STL map)
- poj 3481 Double Queue
- Double Queue POJ 3481
- POJ 3481 Double Queue
- POJ 3481 Double Queue
- POJ 3481 Double Queue
- POJ 3481 Double Queue
- POJ 3481 Double Queue
- poj 3481 Double Queue
- poj 3481 Double Queue
- 理解同步异步与阻塞非阻塞
- HDU- 3279 - Nth Largest Value
- 如何高效的保证移动互联网应用的质量by陈晔
- VARCHAR(N)类型,utf8编码,则N最大值为多少,n表示什么?
- NetBeans项目启动参数
- POJ - 3481 - Double Queue (STL)
- HelloCharts优秀的图表库
- grails 日期格式化
- 跟ASP.NET MVC一起使用jQuery
- rc.local开机自动挂载samba无效问题
- Cocos2d-x怪物智能AI怪物也有智商--之游戏开发《赵云要格斗》(6) cocos2dx 3.3移植版
- 搬家咯
- HDU 2063 过山车 (二分匹配之匈牙利算法)
- 如何实施大型移动应用开发