Double Queue（SET水题）

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
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
2
1 20 14
1 30 3
2
1 10 99
3
2
2
0
Sample Output
0
20
30
10
0

一堆操作，操作1，把概率为p的用户k放入队列，操作2，把队伍中最大概率的人拿出来，操作3，把队伍中概率最小的人拿出来，操作0，终止程序。
如果队列没有人，则操作2，3输出0。

啊啊啊，直接set啊，傻逼写了半天线段树，还想了删除，别人十分钟过了我还傻乎乎写线段树……stl不熟啊。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<utility>
#include<sstream>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1000005;
int n;
vector<int>ans;
struct Node
{
    int k,p;
    bool operator < (const Node& r)const
    {
        return p < r.p;
    }
};
int main()
{
    #ifdef LOCAL
    freopen("C:\\Users\\巍巍\\Desktop\\in.txt","r",stdin);
    //freopen("C:\\Users\\巍巍\\Desktop\\out.txt","w",stdout);
    #endif // LOCAL
    set<Node>st;
    while(scanf("%d",&n) != EOF)
    {
        if(n == 0)break;
        else if(n == 1)
        {
            Node temp;
            scanf("%d%d",&temp.k,&temp.p);
            st.insert(temp);
        }
        else if(n == 2)
        {
            if(st.size())
            {
                set<Node>::iterator it = st.end();
                --it;
                ans.push_back(it -> k);
                st.erase(it);
            }
            else
                ans.push_back(0);
        }
        else
        {
            if(st.size())
            {
                set<Node>::iterator it = st.begin();
                ans.push_back(it -> k);
                st.erase(it);
            }
            else
                ans.push_back(0);
        }
    }
    for(int i = 0;i < ans.size();i++)
        printf("%d\n",ans[i]);
    return 0;
}