HDU 1908 Double Queue(set)
来源:互联网 发布:淘宝卖家寄寿衣怎么办 编辑:程序博客网 时间:2024/05/22 05:19
Problem 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.
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
21 20 141 30 321 10 993220
Sample Output
02030100STL乃神器,set的使用。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<limits.h>#include<set>using namespace std;struct node{ int v,p; bool operator<(const node &a)const//p大的优先 { return p>a.p; }};int main(){ int u; set<node>q; node temp; while(~scanf("%d",&u)) { if(u==0) break; if(u==1) { scanf("%d%d",&temp.v,&temp.p); q.insert(temp); } else if(q.empty()) puts("0"); else if(u==2) { printf("%d\n",q.begin()->v); q.erase(q.begin()); } else { set<node>::iterator it=q.end(); it--; printf("%d\n",it->v); q.erase(it); } } return 0;}
1 0
- HDU 1908 Double Queue(set)
- HDU 1908 Double Queue
- HDU 1908 Double Queue
- HDU 1908 Double Queue
- hdu 1908 : Double Queue
- HDU-1908-Double Queue
- Double Queue(SET水题)
- HDU 1908 Double Queue (解题报告)
- acm hdu 1908 Double Queue
- hdu 1908 Double Queue (map)
- hdu 1908 Double Queue ( splay )
- hdu 1908 Double Queue (map)
- POJ 3481 Double Queue (STL SET)
- <set> Double Queue (P3481)
- Double Queue set解法
- HDU--1908Double Queue【STL--map】
- hdu 5249(set + queue)
- [poj 3481]Double Queue[set || map][STL]
- hdu 1498
- C/C++高精度计时器类
- hdu1698Just a Hook segment_tree
- hdu 2119
- poj 3041
- HDU 1908 Double Queue(set)
- JQuery时间格式化插件--扩展JQuery
- ny 436 sum of all integer numbers
- 我的技术博客开通了
- hdu 2255 km入门题
- hdu1394Minimum Inversion Number_forces(segment_tree)
- 《深度探索C++对象模型》读书笔记之Function语意学
- POJ 2018 Best Cow Fences
- 通过网站微调提升排名和转化率