priority_queue和sort应用

#include"iostream"
#include"String"
#include"stdio.h"
#include "string.h"
#include <queue>
#include <algorithm>
using namespace std;
class Number{
    public:
    int a;
    bool operator <(const Number &m) const{
        return a > m.a;
    }
};
priority_queue<Number> q;
bool compare(int a,int b)
{
    return a > b;//如果是>就是从大到小，是<就是从小到大
}
int main()
{

    Number num[];
    num[].a = ;
    num[].a = ;
    num[].a = ;
    num[].a = ;
    num[].a = ;
    int i;
    for(i = ;i < ;i++)
        q.push(num[i]);
    while(!q.empty())
    {
        cout<<q.top().a<<"\t";
        q.pop();
    }
    cout<<endl;
    int a[] = {,,,,};
    sort(a,a+,compare);
    for(i =  ;i < ; i++)
        cout<<a[i]<<"\t";

}

结果如下