【Map】Double Queue
2016-04-27 23:16
295 查看
[b]Double Queue[/b]
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:
Your 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
Sample Output
题目大意:
有三个操作,1 K P:设置点K的优先级为P;
2 :输出优先级最高的点,并且删除该点
3 :输出优先级最低的点,并且删除该点
0:退出
用map处理,插入和查找的复杂度都为log n;
View Code
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 13258 | Accepted: 5974 |
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:
0 | The system needs to stop serving |
1 K P | Add client K to the waiting list with priority P |
2 | Serve the client with the highest priority and drop him or her from the waiting list |
3 | Serve the client with the lowest priority and drop him or her from the waiting list |
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
2 1 20 14 1 30 3 2 1 10 99 3 2 2 0
Sample Output
0 20 30 10 0
题目大意:
有三个操作,1 K P:设置点K的优先级为P;
2 :输出优先级最高的点,并且删除该点
3 :输出优先级最低的点,并且删除该点
0:退出
用map处理,插入和查找的复杂度都为log n;
#include <iostream> #include <algorithm> #include <string> #include <queue> #include <stdio.h> #include <map> #include <string.h> #include <stdlib.h> using namespace std; int main() { int T,a,P,K; map<int,int>ID; map<int,int>::iterator it; while(scanf("%d",&a)!=EOF){ switch(a){ case 1: scanf("%d%d",&P,&K); ID[K]=P;break; case 2: if(ID.empty())printf("0\n"); else { it=ID.end();it--; printf("%d\n",it->second); ID.erase(it); } break; case 3: if(ID.empty())printf("0\n"); else { it=ID.begin(); printf("%d\n",it->second); ID.erase(it); } break; case 0: return 0; } } return 0; }
View Code
相关文章推荐
- hdu1005Number Sequence
- EasyUI datagrid groupview 分组勾选问题的解决
- Android在非UI线程中显示Toast
- ajax异步处理时,如何在JS中获取从Servlet或者Action中session,request
- Android系统Surface机制的SurfaceFlinger服务渲染应用程序UI的过程分析
- Hue简介
- hdu 5667 Sequence(BC——矩阵快速幂)
- 如何在UITableView里动态添加 cell
- 几种常用容器的分析与比较
- IOS开发-UIView之动画效果的实现方法(
- 共同学习Java源代码--常用工具类--AbstractStringBuilder(七)
- 开发测试时给 Kafka 发消息的 UI 发送器――Mikasa
- 详解 $_SERVER 函数中QUERY_STRING和REQUEST_URI区别
- leetcode-303. Range Sum Query - Immutable
- Android 图文混排spannableStringBuilder简单使用
- IDEA 主题、字体、编辑区主题、文件编码修改
- 设置UITabBarController的用法
- js/jquer获取web页面上传文件的大小
- sdut 2605 Mountain Subsequences(树状数组)
- Implement Stack using Queues