Time
Limit: 5000/2000 MS (Java/Others) Memory Limit:
65535/32768 K (Java/Others)
Total Submission(s):
2176 Accepted Submission(s):
921
#include<stdio.h> #include<string.h> #include<stdlib.h> #define maxn 500002 struct data { int st; int en; }; data time[maxn]; int cmp(const void *a ,const void *b) { if((*(data *)a).st==(*(data *)b).st) return (*(data *)a).en - (*(data *)b).en; return (*(data *)a).st - (*(data *)b).st; } int main() { int n,i,hh_1,mm_1,hh_2,mm_2; while(scanf("%d",&n)!=EOF) { for(i=0 ; i<n ;i++) { scanf("%d:%d %d:%d",&hh_1,&mm_1,&hh_2,&mm_2); time[i].st=hh_1*60+mm_1; time[i].en=hh_2*60+mm_2; } qsort(time,n,sizeof(time[0]),cmp); int res=time[0].st,maxc; maxc=time[0].en; for(i=1;i<n;i++) { if(time[i].st>maxc) res+=time[i].st-maxc; if(maxc<time[i].en) maxc = time[i].en ; } printf("%d\n",res+1440-maxc); } return 0; }
HDUOJ----4509湫湫系列故事——减肥记II,布布扣,bubuko.com
原文:http://www.cnblogs.com/gongxijun/p/3608747.html