1006. Sign In and Sign Out (25)

最新推荐文章于 2022-02-20 10:22:11 发布

要认认真真

最新推荐文章于 2022-02-20 10:22:11 发布

阅读量346

点赞数

分类专栏： pat-a-简单模拟

本文链接：https://blog.csdn.net/dy476813515/article/details/43404931

版权

pat-a-简单模拟专栏收录该内容

41 篇文章 0 订阅

订阅专栏

点击打开链接

#include <cstdio>
#include <string.h>
#include <algorithm>
using namespace std;
int n;
struct s{
	char id[20];
	int inh;
	int inm;
	int ins;
	int outh;
	int outm;
	int outs;
}rec[10000000];
bool cmpin(s a,s b){
	if(a.inh!=b.inh){
		return a.inh<b.inh;
	}else{
		if(a.inm!=b.inh){
			return a.inm<b.inm;
		}else{
			return a.ins<b.ins;
		}
	}
}
bool cmpout(s a,s b){
	if(a.outh!=b.outh){
		return a.outh>b.outh;
	}else{
		if(a.outm!=b.outh){
			return a.outm>b.outm;
		}else{
			return a.outs>b.outs;
		}
	}
}
int main(){
	freopen("in.txt","r",stdin);
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%s %d:%d:%d %d:%d:%d",
			&rec[i].id,&rec[i].inh,&rec[i].inm,&rec[i].ins,&rec[i].outh,&rec[i].outm,&rec[i].outs);
	}
	sort(rec,rec+n,cmpin);
	printf("%s ",rec[0].id);
	sort(rec,rec+n,cmpout);
	printf("%s\n",rec[0].id);
	return 0;
}