学步园

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
struct Person
{
	string id;
	string beg;
	string end;
	friend istream & operator>>(istream &is, Person &p) 
	{ 
		is>>p.id>>p.beg>>p.end;
		return is;
	} 
};
bool Desc(Person a, Person b)
{
	return a.end>b.end;
}
bool Asc(Person a, Person b)
{
	return a.beg<b.beg;
}
int main()
{
	int count =0;
	string id1, id2;
	vector<Person> pvec;
	cin>>count;
	Person p;
	for(int i=0; i<count; i++)
	{
		cin>>p;		
		pvec.push_back(p);
	}
	sort(pvec.begin(), pvec.end(), Asc);
	id1 = pvec[0].id;
	sort(pvec.begin(), pvec.end(), Desc);
	id2 = pvec[0].id;
	cout<<id1<<" "<<id2<<endl;
	return 0;
}