解题思路:
注意事项:
参考代码:
#include<cstdio> #include<algorithm> using namespace std; struct date{ int day; int mon; int yea; }d[10000]; bool cmp(const struct date &a, const struct date &b){ return a.yea<b.yea || a.yea==b.yea&&a.mon<b.mon || a.yea==b.yea&&a.mon==b.mon&&a.day<b.day; } int main(){ int n=0; while(scanf("%d/%d/%d",&d[n].day,&d[n].mon,&d[n].yea)!=EOF) ++n; sort(d,d+n,cmp); for(int i=0; i<n; ++i){ if(d[i].day<10) printf("0"); printf("%d/",d[i].day); if(d[i].mon<10) printf("0"); printf("%d/%d\n",d[i].mon,d[i].yea); } return 0; }
0.0分
0 人评分