XDOJ 文件排序

#include<stdio.h>
#include<string.h>
#define maxd 100+5
typedef struct {
	int year;
	int month;
	int day;
	long long memory;
}file;
file s[maxd];
void swap(file*p1,file*p2){
	file temp=*p1;
	*p1=*p2;
	*p2=temp;
}
int main(){
	int n;
	int i;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d/%d/%d %d",&s[i].year,&s[i].month,&s[i].day,&s[i].memory);
	}
	int max;
	int j;
	for(i=0;i<n-1;i++){
		max=i;
		for(j=i+1;j<n;j++){
			if(s[j].year>s[max].year)
			{
				max=j;
			}
			else if(s[j].year==s[max].year){
				if(s[j].month>s[max].month) max=j;
				else if(s[j].month==s[max].month){
					if(s[j].day>s[max].day) max=j;
					else if(s[j].day==s[max].day){
						if(s[j].memory>s[max].memory) max=j;
					}
				}
			}
		}
		if(max!=i) swap(&s[max],&s[i]);
	}
	for(i=0;i<n;i++){
		printf("%d/%d/%d %d",s[i].year,s[i].month,s[i].day,s[i].memory);
		if(i!=n-1) printf("\n");
	}
	
	
	
	return 0;
}