PAT甲题题解-1006. Sign In and Sign Out (25)-找最小最大
判断哪个人最早到,哪个人最晚走
水,就是找最大值最小值
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <string.h> using namespace std; int m; char unlock[20],lock[20]; char start[20]="25:00:00",endtime[20]="00:00:00"; int main() { char id[20],time1[20],time2[20]; scanf("%d",&m); for(int i=0;i<m;i++){ scanf("%s %s %s",id,time1,time2); if(strcmp(time1,start)<0){ strcpy(unlock,id); strcpy(start,time1); } if(strcmp(time2,endtime)>0){ strcpy(lock,id); strcpy(endtime,time2); } } printf("%s %s",unlock,lock); return 0; }