L3-002 特殊堆栈 (30分)

#include<bits/stdc++.h>
using namespace std;
int n,num;
string s;
int cnt,flag;
vector<int>ans;
vector<int>before;
vector<int>::iterator it;
int main()
{
    cin>>n;
    while(n--)
    {
        cin>>s;
        if(s=="Pop")
        {
            if(before.empty())
            printf("Invalid\n");
            else
            {
                printf("%d\n",before.back());
                it=lower_bound(ans.begin(),ans.end(),before.back());
                ans.erase(it);
                before.pop_back();
            }
        }
        else if(s=="Push")
        {
            cin>>num;
            it=lower_bound(ans.begin(),ans.end(),num);
            ans.insert(it,num);
            before.push_back(num);
        }
        else if(s=="PeekMedian")
        {
            if(ans.size()==0)
            printf("Invalid\n");
            else
            {
                int cur=(ans.size()+1)/2-1;
                printf("%d\n",ans[cur]);
            }
        }
        else
        {
            printf("Invalid\n");
        }
    }
    return 0;
}