T227063 生日 - 洛谷 | 计算机科学教育新生态

#include<bits/stdc++.h>
using namespace std ;
struct pel {
	string name ; 
	int ddd ;
	int age ;
	int num ;
}a[10000];

bool cmp (pel c , pel d ) {
	if (c.ddd != c.ddd ) return c.ddd > d.ddd ;
	else return c.ddd < d.ddd ;
}
int main () {
	
	int n ;
	cin >> n ;
	for (int i = 0 ; i < n ; i ++ ) {
		cin >> a[i].name >>a[i].ddd >> a[i].age >> a[i].num;
	}
	for (int i = 0 ; i < n ; i ++ ) {
		if (a[i].ddd > a[i + 1].ddd  ) {
			sort(a + 0 , a + n ,  cmp ) ;
			i - 1 ;
			//continue ;
		}else if ( a[i].age > a[i].age ) {
			sort(a + 0 , a + n ,  cmp ) ;
			i - 1 ;
			//continue ;
		}else if (a[i].num > a[i].num ) {
			sort(a + 0 , a + n ,  cmp ) ;
			i - 1 ;
			//continue ;
		}
		}
	
	
	for (int i = 0 ; i < n ; i ++ ) {
		cout << a[i].name << endl ;
	}
	
	return 0 ;
}