题目链接
题目思路:cmp函数
代码实现
#include<bits/stdc++.h> using namespace std; struct timem { int hr,min,sec; }ti[5005]; bool cmp(timem a,timem b) { if(a.hr==b.hr) { if(a.min==b.min) return a.sec<b.sec; else return a.min<b.min; } else return a.hr<b.hr; } int main() { int n; cin>>n; for(int i=0;i<n;i++) cin>>ti[i].hr>>ti[i].min>>ti[i].sec; sort(ti,ti+n,cmp); for(int i=0;i<n;i++) cout<<ti[i].hr<<' '<<ti[i].min<<' '<<ti[i].sec<<endl; return 0; }