优先队列 引自:洛谷P3378 【模板】堆 #输入 5 1 2 1 5 2 3 2 #输出 2 5 AC代码: #include <iostream> #include <queue> using namespace std; typedef long long ll; priority_queue<ll,vector<int>,greater<int> > q; int main() { ll n; cin>>n; while(n--){ int key; ll num; cin>>key; if(key == 1){ cin>>num; q.push(num); } else