https://www.patest.cn/contests/pat-a-practise/1006
题目地址如上
解题思路:水题,非常简单,直接全遍历,统计记录最大值和最小值输出即可,算法复杂度O(N)
坑点:无
代码如下:
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
//const string max = "23:59:59";
//const string min = "00:00:00";
string max_i, in_id;
string min_i, out_id;
int main(void)
{
string line;
while(getline(cin, line))
{
int times;
in_id.clear();
out_id.clear();
stringstream ss(line);
ss >> times;
max_i = "00:00:00";
min_i = "23:59:59";
for(int i = 0; i < times; i++)
{
getline(cin, line);
stringstream ss(line);
string in;
string out;
string id;
ss >> id;
ss >> in;
ss >> out;
if(in <= min_i)
{
min_i = in;
in_id = id;
}
if(out >= max_i)
{
max_i = out;
out_id = id;
}
}
cout << in_id << " " << out_id << endl;
}
return 0;
}