蒟蒻求助

萌新离线求助 这题不用单调队列能不能过 这个代码老是被最大三个点卡 能不能帮忙极限优化一下QAQ

#include<iostream>
#include<queue>
#include<map>
using namespace std;

int main()
{
    long long n,k,i,qstore;
    map<long long,long long> counter;
    map<long long,long long>::iterator x;
    queue<long long> answer1,answer2,store;
    cin>>n>>k;

    for(i=1;i<=k;++i)
        cin>>qstore,
        ++counter[qstore],
        store.push(qstore);

    for(;i<=n;++i)
    {
        answer1.push(counter.begin()->first);
        answer2.push(counter.rbegin()->first);
        x=counter.find(store.front());
        if(x->second==1)
            counter.erase(x);
        else
            --x->second;
        store.pop();

        cin>>qstore;
        store.push(qstore);
        ++counter[qstore];
    }
    answer1.push(counter.begin()->first);
    answer2.push(counter.rbegin()->first);

    while(!answer1.empty())
        cout<<answer1.front()<<' ',
        answer1.pop();
    cout<<'\n';
    while(!answer2.empty())
        cout<<answer2.front()<<' ',
        answer2.pop();

    counter.clear();
    return 0;
}