代码如下
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int,int> first,pair<int,int> next){
return first.second>next.second;
}
int main(){
int n;
vector<pair<int ,int> > vec;
while(cin>>n){
for(int i = 0;i<n;i++){
int x,y;
cin>>x>>y;
vec.push_back(make_pair(x,y));
}
sort(vec.begin(),vec.end(),cmp);
int max = 0;
vector<pair<int,int> >::iterator it = vec.begin();
for(;it!=vec.end();it++){
if(it->first>max){
cout<<it->first<<" "<<it->second<<endl;
max = it->first;
}
}
}
return 0;
}