转载：带修优先队列

msjing在翻老学长题解时无意发现的，遂转载
原blog

struct cpq
{priority_queue<int>add,del;void push(int x) add.push(x);void pop(int x) del.push(x);int top(){while(!add.empty()&&!del.empty()){if(add.top()!=del.top()) return add.top();add.pop();del.pop();}if(add.empty()) return -0x3f3f3f3f;return add.top();}
};

拜谢学长/bx/bx/bx