题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2013
水~~
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
const int total_time = 24 * 60;
struct Node{
int L,R;
}data[500005];
bool cmp(Node a,Node b){
if(a.L == b.L) return a.R < b.R;
return a.L < b.L;
}
int main(){
int n;
while(~scanf("%d",&n)){
int h1,m1,h2,m2;
for(int i = 0;i < n;++i){
scanf("%d:%d %d:%d",&h1,&m1,&h2,&m2);
data[i].L = h1 * 60 + m1;
data[i].R = h2 * 60 + m2;
}
sort(data,data+n,cmp);
int work_time = 0,endtime = 0;
for(int i = 0;i < n;++i){
if(data[i].L >= endtime){
work_time += data[i].R - data[i].L;
endtime = data[i].R;
}
else if(data[i].R <= endtime) continue;
else {
work_time += data[i].R - endtime;
endtime = data[i].R;
}
}
printf("%d\n",total_time - work_time);
}
return 0;
}