64分,救助赏关
查看原帖
64分,救助赏关
1364766
auspicious2013楼主2024/8/27 19:24

如题,c++代码如下:

#include<bits/stdc++.h>
using namespace std;
int n;
struct birth{
	string s;
	int y,m,d,k;
}a[105];
bool cmp(birth q,birth p){
	if(q.y!=p.y){
		return q.y<p.y;
	}else{
		if(q.m!=p.m){
			return q.m<p.m;
		}else{
			if(q.d!=p.d){
				return q.d<p.d;
			}else{
				return q.k<p.k;
			}
		}
	}
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].s>>a[i].y>>a[i].m>>a[i].d;
		a[i].k=i;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++){
		cout<<a[i].s<<endl;
	}
	return 0;
}
2024/8/27 19:24
加载中...