【PAT甲】1006 Sign In and Sign Out (25分)循环模拟

2024-04-17 02:16:30

problem

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

给出n个人的id和登录登出时间
求最早进来和最早出去的人的ID

solution

将时间都转为总秒数，输入的时候更新即可

#include<iostream>
#include<string>
using namespace std;
int main(){int n;  cin>>n;int zaojin=9999999,zaochu=0;string jin, chu;for(int i = 1; i <= n; i++){string s; cin>>s;int h1, m1, s1, h2, m2, s2;scanf("%d:%d:%d",&h1,&m1,&s1);scanf("%d:%d:%d",&h2,&m2,&s2);int t1 = h1*3600+m1*60+s1;int t2 = h2*3600+m2*60+s2;if(t1<zaojin){zaojin = t1;jin = s;}if(t2>zaochu){zaochu = t2;chu = s;}}cout<<jin<<" "<<chu;return 0;
}

【PAT甲】1006 Sign In and Sign Out (25分)循环模拟相关推荐

PAT(乙级)1006 换个格式输出整数 (15 分) (C语言)
让我们用字母 B 来表示"百".字母 S 表示"十",用 12-n 来表示不为零的个位数字 n(<10),换个格式来输出任一个不超过 3 位的正整数.例如 ...
【PAT (Advanced Level) Practice】1051 Pop Sequence (25 分)
1051 Pop Sequence (25 分) Given a stack which can keep M numbers at most. Push N numbers in the order ...
【PAT (Advanced Level) Practice】1037 Magic Coupon (25 分)
题意: 给出两个集合,从这两个集合里面选出数量相同的元素进行一对一相乘,求能够得到的最大乘积之和. 题解: 对每个集合,将正数和负数分开考虑,将每个集合里的整数从大到小排序:将每个集合里的负数从小到大 ...
【PAT乙级】1005 继续(3n+1)猜想 (25 分)
https://pintia.cn/problem-sets/994805260223102976/problems/994805320306507776 题目给的意思就是说:如果这个数不能被其它数通 ...
【PAT甲级 BigInteger运算】1024 Palindromic Number (25 分) Java 全部AC
题目题解 Java 一开始用C++写的,有两个大数的测试点过不去,后来改用Java的BigInteger开挂,全部通过 import java.io.BufferedReader; import j ...
【PAT甲级排序】1012 The Best Rank (25 分) C++ 全部AC
题目中规中矩的一道题.排名的顺序一开始没太明白,但是理解之后写起来挺流畅的,没什么坑. 解题思路:题目会给出所有学生所有科目的成绩.想要看分学生的学号. 我们要先给这些学生单科成绩排序,算出它们的单 ...
【PAT甲级排序】1036 Boys vs Girls (25 分) C++
题目是个水题,排序就完事. 输出女生最高分的学生,男生最低分的学生,并计算分差. 一点点小坑:让输出啥,看清楚再写,不要靠记忆做题一开始把题目中要求输出的NA看成了NAN,一开始有两个测试用例过不 ...
PAT甲级 -- 1079 Total Sales of Supply Chain (25 分)
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
PAT甲级 -- 1090 Highest Price in Supply Chain (25 分)
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...

最新文章

热门文章