极光 · STL库测试 · priority_Queue与Struct

优先队列-极简

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <queue>
using namespace std;
#define s1(x) priority_queue<int> x
#define s2(x) priority_queue<int, vector<int>, greater<int>> x
int main()
{
    s1(a);
    int b[20] = {85, 74, 96, 35, 45, 21, 75, 97, 31, 25};
    for (int x = 0; x < 10; x++) //默认是大头在前
        a.push(b[x]);
    while (a.size() != 0)
        printf("%d ", a.top()), a.pop();
    return 0;
}

//优先队列，默认是大头在前
// sort，默认是小头在前

大头：priority_queue<int> a

小头：priority_queue<int, vector<int>, greater<int>> a

优先队列-结构体

#include <iostream>
#include <stdio.h>
#include <queue>
#include <algorithm>
using namespace std;
#define s2(x) priority_queue&