p3110 二叉堆练习3--排序

/*作者:QHY题目:p3110 二叉堆练习3*/#include<cstdio>#include<iostream>#include<cstring>#include<queue>using namespace std;struct node{    int l,r,n;};int x,y,n;priority_queue<int,vector<int>,greater<int> >q;int main(){    cin>>n;    while(n--){        cin>>x;        q.push(x);    }    while(!q.empty()){        cout<<q.top()<<' ';        q.pop();    }    return 0;}

#include<cstdio>#include<iostream>#include<cstring>#include<queue>#include<algorithm>using namespace std;struct node{    int l,r,n;};int x,y,n,i;int a[500001];int main(){    cin>>n;    while(n--){        cin>>a[i++];    }    sort(a,a+i,greater<int>());    //stable_sort(a,a+i,greater<int>());    while(i--)cout<<a[i]<<' ';    return 0;}