#include <iostream>
#include <queue>
using namespace std;
priority_queue< int, vector<int>, greater<int> > q;
priority_queue< int, vector<int>, less<int> > q2;
int main(){
q.push(3);
q.push(2);
while(!q.empty()){
cout << q.top(); q.pop();
}
cout << endl;
q2.push(2);
q2.push(3);
while(!q2.empty()){
cout << q2.top(); q2.pop();
}
return 0;
}
优先队列-priority_queue-模板
最新推荐文章于 2022-10-04 14:24:58 发布