#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(){
priority_queue<int,vector<int>,greater<int> > pq;
priority_queue<int,vector<int>,less<int> > pq2;
int n;
int a[100];
cin >> n;
for(int i = 0; i < n;i++){
cin >> a[i];
pq.push(a[i]);
pq2.push(a[i]);
}
for(int i = 0; i<n ;i++){
cout << pq.top()<< " ";
pq.pop();
}
cout << endl;
for(int i = 0; i<n ;i++){
cout << pq2.top()<< " ";
pq2.pop();
}
cout << endl;
return 0;
}
【编程语言】C++中优先队列(最大堆)的用法
最新推荐文章于 2024-04-09 22:03:48 发布