#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int,int> pii;
vector<pii>res;
int main()
{
int n,h1,h2,m1,m2,s1,s2;
cin>>n;
for(int i=0;i<n;i++)
{
scanf("%d:%d:%d - %d:%d:%d",&h1,&m1,&s1,&h2,&m2,&s2);
res.push_back({h1*3600+m1*60+s1,h2*3600+m2*60+s2});//以秒为单位存入数组中
}
sort(res.begin(),res.end());//排序
if(res[0].first!=0)//细分情况
printf("00:00:00 - %02d:%02d:%02d\n",res[0].first/3600,res[0].first%3600/60,res[0].first%60);
for(int i=0;i<res.size()-1;i++)
{
if(res[i].second!=res[i+1].first)
{
printf("%02d:%02d:%02d - %02d:%02d:%02d\n",res[i].second/3600,res[i].second%3600/60,res[i].second%60,res[i+1].first/3600,res[i+1].first%3600/60,res[i+1].first%60);
}
}
int l=res.size()-1;
if(res[l].second!=86399)
printf("%02d:%02d:%02d - 23:59:59\n",res[l].second/3600,res[l].second%3600/60,res[l].second%60);
return 0;
}
L2-042 老板的作息表
最新推荐文章于 2025-04-30 16:36:16 发布