代码
#include<cstdio>
#include<queue>
#include<iostream>
using namespace std;
typedef pair<int,int> prefix;
struct cmp
{
bool operator()(const prefix p1,const prefix p2)
{
return p1.second>p2.second;
}
};
int main()
{
priority_queue<prefix,vector<prefix>,cmp>asd;
int n;
scanf("%d",&n);
for(int i=1,st,ed;i<=n;i++)
{
scanf("%d%d",&st,&ed);
asd.push(pair<int,int>(st,ed));
}
prefix it;
while(!asd.empty())
{
it=asd.top();
asd.pop();
printf("%d %d\n",it.first,it.second);
}
return 0;
}
优点
可以弥补一下map的不足吧????