【优先级队列】 Holedox Eating

https://www.bnuoj.com/v3/contest_show.php?cid=9154#problem/M

【Accepted】

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<string>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<stack>
 #include<map>
 using namespace std;
 int l,n;
 int main()
 {
     int T;
     scanf("%d",&T);
     int cas=;
     while(T--)
     {
         priority_queue<int,vector<int>,greater<int>> qr;
         priority_queue<int> ql;
         scanf("%d%d",&l,&n);
         int pos=;
         int dir=;
         int ans=;
         for(int i=;i<n;i++)
         {
             int op;
             scanf("%d",&op);
             if(op==)
             {
                 int x;
                 scanf("%d",&x);
                 if(x<pos) ql.push(x);
                 else qr.push(x);
             }
             else
             {
                 if(!ql.empty()&&!qr.empty())
                 {
                     int t1=ql.top();
                     int t2=qr.top();
                     if(pos-t1==t2-pos)
                     {
                         if(dir==)
                         {
                             ans+=t2-pos;
                             qr.pop();
                             pos=t2;
                             dir=;
                         }
                         else
                         {
                             ans+=pos-t1;
                             ql.pop();
                             pos=t1;
                             dir=;
                         }
                     }
                     else if(pos-t1<t2-pos)
                     {
                         ans+=pos-t1;
                         ql.pop();
                         pos=t1;
                         dir=;

                     }
                     else if(pos-t1>t2-pos)
                     {
                         ans+=t2-pos;
                         qr.pop();
                         pos=t2;
                         dir=;
                     }
                 }
                 else if(!ql.empty())
                 {
                     int t1=ql.top();
                     ans+=pos-t1;
                     ql.pop();
                     pos=t1;
                     dir=;
                 }
                 else if(!qr.empty())
                 {
                     int t2=qr.top();
                     ans+=t2-pos;
                     qr.pop();
                     pos=t2;
                     dir=;
                 }
             }
         }
         printf("Case %d: %d\n",++cas,ans);
     }
     return ;
 }