POJ - 3481 Double Queue

1.题面

http://poj.org/problem?id=3481

2.解题思路

实现一个队列，支持插入，删除最大值，删除最小值三种操作。直接用STL中的set实现就好了。

3.解题代码

/*****************************************************************
    > File Name: tmp.cpp
    > Author: Uncle_Sugar
    > Mail: uncle_sugar@qq.com
    > Created Time: 2016年02月24日 星期三 09时17分38秒
 ****************************************************************/
# include <cstdio>
# include <cstring>
# include <cmath>
# include <cstdlib>
# include <climits>
# include <iostream>
# include <iomanip>
# include <set>
# include <map>
# include <vector>
# include <stack>
# include <queue>
# include <algorithm>
using namespace std;

const int debug = 1;
const int size  = 5000 + 10; 
typedef long long ll;

struct person{
	int id,p;
	person(int _id,int _p):id(_id),p(_p){}
	bool operator < (const person& cmper)const{
		return p < cmper.p;
	}
};
set<person> st;
void Add(){
	int a,b;
	cin >> a >> b;
	st.insert(person(a,b));
}
void Serve_high(){
	if (st.empty())	
		cout << 0 << '\n';
	else {
		set<person>::iterator it = st.end();
		it--;
		cout << it->id << '\n';
		st.erase(it);
	}
}
void Serve_low(){
	if (st.empty())
		cout << 0 << '\n';
	else {
		set<person>::iterator it = st.begin();
		cout << it->id << '\n';
		st.erase(it);
	}
}
int main()
{
	std::ios::sync_with_stdio(false);cin.tie(0);
	int i,j,k;
	int cmd;
	while (cin >> cmd&&cmd){
		switch(cmd){
			case 1:Add();break;
			case 2:Serve_high();break;
			case 3:Serve_low();break;
		}
	}
	return 0;
}