【stl】 优先队列小实验

 //被实验的代码君qwq
 //优先队列默认大根堆哟，greater可以重载小于号
 1 #include<queue>
#include<cstdio>
#include<iostream>
using namespace std;
priority_queue<int, vector<int>, less<int> >q1;
priority_queue<int, vector<int>, greater<int> >q2;
priority_queue<int>q3;
int n;
int main() {
    cin>>n;
    int x;
    for(int i = 1; i <= n; i++) {
        cin>>x;
        q1.push(x), q2.push(x), q3.push(x);
    }
    cout<<"less: ";
    for(int i = 1; i <= n; i++) {
        cout<<q1.top()<<' ';
        q1.pop();
    }
    cout<<endl<<"greater: ";
    for(int i = 1; i <= n; i++) {
        cout<<q2.top()<<' ';
        q2.pop();
    }
    cout<<endl<<"wu: ";
    for(int i = 1; i <= n; i++) {
        cout<<q3.top()<<' ';
        q3.pop();
    }
}

　　结果：