1006 Sign In and Sign Out
题意
给定一些列学生到达和离开时间，找到最早到和最晚走的学生
思路
太简单
源码
line_number: true1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
| #include <iostream>
#include <stdio.h>
#include <map>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
using namespace std;
int main()
{
int iM;
scanf("%d", &iM);
string strStudentId;
string strSignIn;
string strSignOut;
string strMinSignInId;
string strMinSignInTime = "24:00:00";
string strMinSignOutId;
string strMaxSignOutTime = "00:00:00";
for(int i = 0; i < iM; i ++)
{
cin >> strStudentId >> strSignIn >> strSignOut;
if(strMinSignInTime >= strSignIn)
{
strMinSignInId = strStudentId;
strMinSignInTime = strSignIn;
}
if(strMaxSignOutTime <= strSignOut)
{
strMinSignOutId = strStudentId;
strMaxSignOutTime = strSignOut;
}
}
cout<< strMinSignInId << " " << strMinSignOutId <<endl;
return 0;
}
|