E - Sorting Queries（模拟）

E - Sorting Queries

• 题意：有Q个询问

Each query is of one of the three kinds below:
1 x : Append x to the end of A.
2 : Print the element at the beginning of A. Then, delete that element. It is guaranteed that A will not empty when this query is given.
3 : Sort A in ascending order.

1≤Q≤2×10⁵
0≤x≤10⁹

• 题解：优先队列 + 数组模拟栈
• 收获：数组模拟栈的好处是可以取出栈底元素，但是stl中的stack不能。

#include<cstdio>
#include<queue>
#include<set>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 2e5 + 7, M = 1e6;
priority_queue<int, vector<int>, greater<int> >p;
int a[N];
int main()
{
	IOS;
	int n, q;
	cin >> q;
	
	int l = 1, r = 0;
	while (q--)
	{
		int x, y;
		cin >> x;
		if (x == 1)
		{
			cin >> y;
			a[++r] = y;
		}
		else if(x == 2)
		{
			if (!p.empty()) cout << p.top() << endl; p.pop();
			else cout << a[l++] << endl;
		}
		else
		{
			for (int i = l; i <= r; i++)
				p.push(a[i]);
			l = 1, r = 0;
		}
	}

	return 0;
}