PAT甲级1006

最新推荐文章于 2024-09-25 13:54:13 发布

zengyz-wh

最新推荐文章于 2024-09-25 13:54:13 发布

阅读量80

点赞数

分类专栏： PAT甲级文章标签： c语言算法数据结构

本文链接：https://blog.csdn.net/qq_34832548/article/details/120092106

版权

PAT甲级专栏收录该内容

44 篇文章 0 订阅

订阅专栏

solution

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
string fir, en;
int first1=0x3f3f3f,end1;

int main()
{
    int n;
    while (cin >> n)
    {

        for (int i = 1; i <= n; i++)
        {
            string temp;
            int x1, x2, x3, y1, y2, y3;
            cin >> temp;
          	scanf("%d:%d:%d",&x1,&x2,&x3);
		scanf("%d:%d:%d",&y1,&y2,&y3);
            int temp1 = x1 * 3600 + x2 * 60 + x3;
            int temp2 = y1 * 3600 + y2 * 60 + y3;
//cout<<temp1<<" "<<first1<<endl;
            if (temp1 < first1)
            {
                first1 = temp1;
                fir = temp;
            }
            if (temp2 > end1)
            {
                end1 = temp2;
                en = temp;
            }
        }
        cout << fir << " " << en;
    }
}