优先队列

#include<iostream>
#include<queue> 
#include<vector> 
using namespace std;

struct cmp {
    bool operator ()(int &a, int &b) {
        return a > b;//从小到大
    }
};

int main(){
    int a[] = { 14,10,56,7,83,22,36,91,3,47 };
    priority_queue<int>que;
    priority_queue<int, vector<int>, cmp>que1;

    for (int i = 0; i < 10; i++) {
        que.push(a[i]);
        que1.push(a[i]);
    }

    while (!que.empty()) {
        cout << que.top() << " ";
        que.pop();
    }

    cout << endl;
    while (!que1.empty()) {
        cout << que1.top() << " ";
        que1.pop();
    }

    system("pause");
    return 0;
}