C++STL之Priority_queue(优先队列)

解题思路:C++STL之Priority_queue(优先队列)
注意事项:

参考代码:

#include<iostream>

#include<queue>

#include<vector>

#include<cmath>

using namespace std;

struct num

{

    int a;

    int b;

};

struct cmp

{

  bool operator()(num x , num y)

  {

      return x.b < y.b;

  }

};

int main()

{

    int n;

    while(cin>>n&&n!=0)

    {

        num x;

        priority_queue<num,vector<num>,cmp> q;

        for(int i = 0; i < n; i++)

        {

            cin>>x.a;//输入原数据

            x.b=abs(x.a);//绝对值

            q.push(x);//结构体入队

        }

        //遍历输出

        while(!q.empty())

        {

            cout<<q.top().a<<" ";

            q.pop();

        }

        cout<<endl;

    }

    return 0;

}