POJ 3481 Double Queue (STL SET)
来源:互联网 发布:pixel gun world mac 编辑:程序博客网 时间:2024/06/11 08:55
题意:
模拟一个有序双端队列,可以执行如下操作
0 代表停机
1 X Y 代表插入一个数 X 它的权重为 Y
2 代表输出权重最大的数并从队列中删除
3 代表输出权重最小的数并从队列中删除
思路:
利用 set 直接写就行。
代码:
#include <iostream>#include <set>#include <cstdio>using namespace std;typedef struct Node{ int x; int y; Node(int xx=0,int yy=0){x=xx;y=yy;} bool operator < (const Node a)const{ return a.y>y; }}Node;set <Node> sett;set <Node> ::iterator it;int main(){ int t,x,y; while(scanf("%d",&t)&&t){ if(t==1){ scanf("%d%d",&x,&y); sett.insert(Node(x,y)); }else if(t==2){ if(sett.empty()) printf("0\n"); else{ it=sett.end(); it--; printf("%d\n",it->x); sett.erase(it); } }else{ if(sett.empty()) printf("0\n"); else{ it=sett.begin(); printf("%d\n",it->x); sett.erase(it); } } }}
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 thelowest priority instead of that with the highest priority. Thus, the system will receive the following types of request:
0The system needs to stop serving1 KPAdd 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.
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.
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.
21 20 141 30 321 10 993220
02030100
- POJ 3481 Double Queue (STL SET)
- [poj 3481]Double Queue[set || map][STL]
- POJ - 3481 - Double Queue (STL)
- POJ 3481 Double Queue(STL)
- POJ 3481 Double Queue(STL)
- POJ 3481 Double Queue(STL)
- POJ 3481 Double Queue(STL)
- POJ 3481 Double Queue(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
- 书单
- stm32 kei4 开发环境搭建
- 配置多数据源(oracle)遇到的一些问题
- Docker 原理剖析
- 苹果公司开发者账号申请
- POJ 3481 Double Queue (STL SET)
- 字符串与数组
- 成为Java顶尖程序员 ,看这10本书就够了
- 文章标题
- 模拟生产者消费者问题
- ubuntu下git使用小技巧
- Webview使用onReceivedSslError方法,apk被Google play rejected
- 筛选素数
- 用python将jenkins构建的apk下载地载生成二维码提供下载