存

#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
	char name[10];
	int year,month,day;
	friend bool operator <(node a,node b)
	{
		if(a.year!=b.year)
			return a.year<b.year;
		else if(a.month!=b.month)
			return a.month<b.month;
		else
			return a.day<b.day;
	}
};
int main()
{
	int n;
	char date[20];
	vector<node> v;
	freopen("1028.txt","r",stdin);
	scanf("%d",&n);
	node s1,s2,s;
	strcpy(s1.name,"x"),s1.year=1814,s1.month=9,s1.day=6;
	strcpy(s2.name,"y"),s2.year=2014,s2.month=9,s2.day=6;
	v.push_back(s1),v.push_back(s2);
	for(int i=0;i<n;i++)
	{
		scanf("%s %s",s.name,date);
		s.year=(date[0]-'0')*1000+(date[1]-'0')*100+(date[2]-'0')*10+(date[3]-'0');
		s.month=(date[5]-'0')*10+(date[6]-'0');
		s.day=(date[8]-'0')*10+(date[9]-'0');
		v.push_back(s);
	}
	sort(v.begin(),v.end());
	int left,right,flag=0;
	for(i=0;i<n+2;i++)
	{
		if(!strcmp(v[i].name,"x")&&(!flag))
		{
			left=i;
			flag=1;
		}
		if((flag)&&!strcmp(v[i].name,"y"))
		{
			right=i;
		}
		printf("%d %s %s",right-left,v[left+1].name,v[right-1].name);
	}
	return 0;
}