//思路:将每天的录入信息保存到vector<Node>容器中,再依次遍历容器,找出最早和最晚的即为开门人和关门人;
//时间的比较可按字符串直接比较大小
#include<iostream>
#include<vector>
#include<string>
using namespace std;
class Node
{
public:
string serial;
string beginTime;
string endTime;
};
int main()
{
int n;
cin>>n;
getchar();
while(n>0)
{
int m;
char buff[50];
cin>>m;
int temp=m;
getchar();
Node node;
vector<Node> vec;
while(temp>0)//m条记录存入vec
{
gets(buff);//输入一条记录
node.serial=strtok(buff," ");//以空格为分割符将记录分割成序号、到达时间和离开时间
node.beginTime=strtok(NULL," ");
node.endTime=strtok(NULL," ");
vec.push_back(node);
temp--;
}
string earliestTime=vec[0].beginTime;
string latestTime=vec[0].endTime;
vector<Node>::size_type flag1=0,flag2=0;
for(int i=1;i<m;++i)
{
if(earliestTime>vec[i].beginTime)
{
earliestTime=vec[i].beginTime;
flag1=i;
}
if(latestTime<vec[i].endTime)
{
latestTime=vec[i].endTime;
flag2=i;
}
}
cout<<vec[flag1].serial<<" "<<vec[flag2].serial<<endl;
n--;
}
return 0;
}
//时间的比较可按字符串直接比较大小
#include<iostream>
#include<vector>
#include<string>
using namespace std;
class Node
{
public:
string serial;
string beginTime;
string endTime;
};
int main()
{
int n;
cin>>n;
getchar();
while(n>0)
{
int m;
char buff[50];
cin>>m;
int temp=m;
getchar();
Node node;
vector<Node> vec;
while(temp>0)//m条记录存入vec
{
gets(buff);//输入一条记录
node.serial=strtok(buff," ");//以空格为分割符将记录分割成序号、到达时间和离开时间
node.beginTime=strtok(NULL," ");
node.endTime=strtok(NULL," ");
vec.push_back(node);
temp--;
}
string earliestTime=vec[0].beginTime;
string latestTime=vec[0].endTime;
vector<Node>::size_type flag1=0,flag2=0;
for(int i=1;i<m;++i)
{
if(earliestTime>vec[i].beginTime)
{
earliestTime=vec[i].beginTime;
flag1=i;
}
if(latestTime<vec[i].endTime)
{
latestTime=vec[i].endTime;
flag2=i;
}
}
cout<<vec[flag1].serial<<" "<<vec[flag2].serial<<endl;
n--;
}
return 0;
}