PAT A1006 2019.07.06 【查找】

1006 Sign In and Sign Out (25 分)

At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and out's, you are supposed to find the ones who have unlocked and locked the door on that day.

Input Specification:

Each input file contains one test case. Each case contains the records for one day. The case starts with a positive integer M, which is the total number of records, followed by M lines, each in the format:

ID_number Sign_in_time Sign_out_time

where times are given in the format HH:MM:SS, and ID_number is a string with no more than 15 characters.

Output Specification:

For each test case, output in one line the ID numbers of the persons who have unlocked and locked the door on that day. The two ID numbers must be separated by one space.

Note: It is guaranteed that the records are consistent. That is, the sign in time must be earlier than the sign out time for each person, and there are no two persons sign in or out at the same moment.

Sample Input:

3
CS301111 15:30:28 17:00:10
SC3021234 08:00:00 11:25:25
CS301133 21:45:00 21:58:40

Sample Output:

SC3021234 CS301133

思路分析

每个人的属性有id intime outtime 因为C语言无法使用类，

但是因为其不含有属性操作，只含有数据，所以直接使用结构体数组存储每个人的信息

时间判定因为输入的时间格式是固定的，所以直接写了一个判断时间的函数，参数为两个字符数组，

对比两个字符数组固定位置的数字即可判断时间大小

此题要注意字符串的输入与输出

 

#include<cstdio>
#include<iostream>
#define MAX	1000 

typedef struct{
	char id[20];
	char in[20];
	char out[20]; 
}record;

record person[MAX];

int isABiggerThanB(char *A,char *B)//是则返回1 
{
	if(A[0]>B[0])return 1;
	else if(A[0]<B[0])return 0;
	else if(A[0]==B[0])
	{
		if(A[1]>B[1])return 1;
	    else if(A[1]<B[1])return 0;
	    else if(A[1]==B[1])
	    {
	        if(A[3]>B[3])return 1;
	        else if(A[3]<B[3])return 0;
	        else if(A[3]==B[3])
	        {	if(A[4]>B[4])return 1;
	            else if(A[4]<B[4])return 0;
	            else if(A[4]==B[4])
	            {	if(A[6]>B[6])return 1;
	                else if(A[6]<B[6])return 0;
	                else if(A[6]==B[6])
	                {	if(A[7]>B[7])return 1;
	                    else if(A[7]<B[7])return 0;
	                    else if(A[7]==B[7])return 0;
					}
				}
			}
		
		} 
		
	} 
	
}


int main()
{
	int M;
	scanf("%d",&M);
	for(int i=0;i<M;i++)
	{
		scanf("%s",person[i].id);
		scanf("%s",person[i].in);
		scanf("%s",person[i].out);
	}	
	
    int early=0,late=0;
    for(int i=1;i<M;i++)
    {
    	if(!isABiggerThanB(person[i].in,person[early].in))early=i;
    	if(isABiggerThanB(person[i].out,person[late].out))late=i;//输入时要注意别把out输入成in 
	}
	printf("%s %s",person[early].id,person[late].id);
	
}