#include<iostream>
#include<queue>
#include <algorithm>
#define PQ priority_queue
using namespace std;
struct sq
{
int a,b;
friend bool operator < (sq x,sq y)
{
return x.a>y.a;
}
};
int main()
{
int i,j,m,n,k;
sq s[100],l[100];
PQ<sq> x;
for (i=0;i<100;i++)
{
s[i].a=rand() % 100;
s[i].b=rand() % 100;
x.push(s[i]);
}
while (!x.empty())
{
cout << x.top().a<<' '<<x.top().b<<endl;
x.pop();
}
}
优先队列——重载运算符
最新推荐文章于 2024-06-22 20:10:28 发布
