Perface

因为本人比较弱，所以把一些用过的黑科技总结一下啦。

Priority_queue（重构小根堆）

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fod(i,a,b) for(i=a;i>=b;i--)
#define PRQ priority_queue
#define CZ friend bool operator
using namespace std;
int n;
struct node
{
    CZ <(node x,node y)
    {
        return x.p>y.p;
    }
    int p;
};
int main()
{
    PRQ<node>a;
    int n,i;
    cin>>n;
    node p;
    fo(i,1,n) scanf("%d",&p.p),a.push(p);
    while (!a.empty()) printf("%d\n",a.top().p),a.pop();
}