1006 Sign In and Sign Out (25 分)

最新推荐文章于 2024-09-11 20:52:11 发布

whiterunofskyrim

最新推荐文章于 2024-09-11 20:52:11 发布

阅读量353

点赞数

本文链接：https://blog.csdn.net/m0_46743929/article/details/122961120

版权

时间管理教室ID 时间戳 C++ 记录排序

关键词由CSDN通过智能技术生成

题目要求：找出最先进教室和最晚出教室的id

没什么难度，将输入中的hh:mm:ss 转换成秒(s)为单位进行比较大小即可

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;

struct Record{
    string id;
    int start, end;
};

bool cmp(Record r1, Record r2){
    return r1.start<r2.start;
}

bool cmp2(Record r1, Record r2){
    return r1.end>r2.end;
}
int main(){
    int n;
    scanf("%d",&n);
    vector<Record> record(n);
    for(int i=0;i<n;i++){
        string s1,s2,s3;
        cin>>s1>>s2>>s3;
        record[i].id = s1;
        
        int h1 = atoi(s2.substr(0,2).c_str());
        int m1 = atoi(s2.substr(3,2).c_str());
        int ss1 = atoi(s2.substr(6,2).c_str());
        int h2 = atoi(s3.substr(0,2).c_str());
        int m2 = atoi(s3.substr(3,2).c_str());
        int ss2 = atoi(s3.substr(6,2).c_str());
        record[i].start = h1*3600+m1*60+ss1;
        record[i].end = h2*3600+m2*60+ss2;
        
    }
    
    sort(record.begin(),record.end(),cmp);
    cout<<record[0].id<<" ";
    sort(record.begin(),record.end(),cmp2);
    cout<<record[0].id<<endl;
}