9.优先队列,priority_queue

#include <iostream>
#include <queue>
#include <deque>
#include <list>
using namespace std;


void main1()
{
    //优先队列
    priority_queue<int> myq;
    myq.push(1);
    myq.push(2);
    myq.push(3);
    myq.push(4);

    while(!myq.empty())
    {
        cout << myq.top() << endl;
        myq.pop();
    }
    cin.get();
}

struct getmoney
{
    char *com;
    int money;
};

struct lessX
{
    bool operator()(struct getmoney &m1, struct getmoney &m2)
    {
        //return m1.money < m2.money;
        if (strcmp(m1.com, m2.com) >= 0)
        {
            return true;
        }
        else
        {
            return false;
        }
    }
};

void main()
{
    //优先队列,采用deque方式容易插入
    priority_queue<getmoney, deque<getmoney>,lessX> myq;
    getmoney getm[5] = { {"Google",30000},{"baidu",20000},{"360",15000},{"sina",10000},{"tecent",18000} };
    for (auto i : getm)
    {
        myq.push(i);
    }
    while (!myq.empty())
    {
        cout << myq.top().com << "  " << myq.top().money << endl;
        myq.pop();
    }
    cin.get();
}