My first 发表于 2019-04-01 | 更新于 2019-04-02 | 评论数: markdown测试1234567priority_queue<int> ins, del;void insert(int x) {ins.push(x);}void deletee(int x) {del.push(x);}int top() { while (!del.empty() and !ins.empty() and del.top() == ins.top()) {del.pop(); ins.pop();} return ins.top();} LaTeX测试 √1+p√1+a2∫baf(x)dx(N2∑k=121k)X=(x11x12…x21x22…⋮⋮⋱)y={aif d>cb+xin the morninglall day long -------------本文结束感谢您的阅读-------------
v1.5.2