2018 UESTC Training for Data Structures 三澄美琴的心里只有学习

三澄美琴的心里只有学习

队列

//33MS   1972KB
#include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
const int MAX=1e5+5;
queue<pair<int,int> >Q;
void read(int &x)
{
    int f=1;x=0;char c=getchar();
    while (c>'9'||c<'0'){if (c=='-')f=-1;c=getchar();}
    while (c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    x*=f;
}
int main ()
{
    int n,x,t,a,b;
    read(n);
    while (!Q.empty()) Q.pop();
    for (int k=0;k<n;k++)
    {
        read(x);read(t);
        while (!Q.empty()&&Q.front().second<=t) Q.pop();
        switch(x)
        {
            case 1:read(a);read(b);
            Q.push(make_pair(a,t+b));
            break;
            case 2:
            if (!Q.empty()) Q.pop();
            break;
            case 3:
            if (!Q.empty()) printf ("%d\n",Q.front().first);
            else printf ("-1\n");
            break;
        }
    }
    return 0;
}