qriority_queue应用

来源:互联网 发布:诺基亚n9价格淘宝 编辑:程序博客网 时间:2024/05/01 06:29

#include <iostream>
#include <queue>
#include<functional>
using namespace std;
class student
{
            private:
                    int score;
                    int finance;
            public:
                   void set(int x,int y);
                   friend bool operator<(student a,student b);
                   int getScore();
                   int getFinance();
};
void student::set(int x,int y)
{
     score=x;
     finance=y;
}
int student::getScore()
{
    return score;
}
int student::getFinance()
{
    return finance;
}
bool operator<(student a,student b)
{
     return a.score<b.score;
}
int main()
{
    int n,c,f;
   
    while(cin>>n>>c>>f)
    {
        int i;
        student* p;
        p=new student[n];
        priority_queue<student> qi;
        for(i=1;i<=n;i++)
        {
            int a,b;
            cin>>a>>b;
            p[i].set(a,b);
            qi.push(p[i]);
        }
        while(!qi.empty())
        {
            cout<<qi.top().getScore()<<" "<<qi.top().getFinance()<<endl;
            qi.pop();
        }
    }
    return 0;
}

倒数第六行报错,不知道怎么修改
   

原创粉丝点击