pat,
这题相对于简单点,主要就是根据时间排序,然后找出最先来和最后走的同学学号。
解题心得:
1、对c++stl库中的sort函数熟悉了一把,会使用了。
2、以00:00:00作为起点来比较,这样就轻松多了。
代码如下:
#include"stdio.h"
#include"string.h"
#include"math.h"
#include<iostream>
#include<vector>
#include<queue>
#include<string>
#include<algorithm>
using namespace std;
#define INF 0x7FFFFFFF
struct sign{
string studentNum;
int comeTime;
int leaveTime;
};
vector<struct sign> students;
int sortByCome(struct sign stu1,struct sign stu2){
if(stu1.comeTime > stu2.comeTime){
return 1;
}else{
return 0;
}
}
int sortByLeave(struct sign stu1,struct sign stu2){
if(stu1.leaveTime > stu2.leaveTime){
return 1;
}else{
return 0;
}
}
int main(){
int num;
while(scanf("%d",&num) != EOF){
students.resize(num);
for(int i = 0;i < num;i++){
struct sign mysign;
char studentNum[20];
scanf("%s",studentNum);
int comeHour,comeMinute,comeSecond,leaveHour,leaveMinute,leaveSecond;
scanf("%d:%d:%d",&comeHour,&comeMinute,&comeSecond);
scanf("%d:%d:%d",&leaveHour,&leaveMinute,&leaveSecond);
int totalCome = comeHour*3600 + comeMinute*60 + comeSecond;
int totalLeave = leaveHour*3600 + leaveMinute*60 + leaveSecond;
mysign.comeTime = totalCome;
mysign.leaveTime = totalLeave;
mysign.studentNum = studentNum;
students[i] = mysign;
}
sort(students.begin(),students.end(),sortByCome);
cout<<students[students.size()-1].studentNum;
sort(students.begin(),students.end(),sortByLeave);
cout<<" "<<students[0].studentNum;
}
return 0;
}