全wa求助!!!
  • 板块P1104 生日
  • 楼主kingofbashu
  • 当前回复4
  • 已保存回复4
  • 发布时间2022/7/21 14:03
  • 上次更新2023/10/27 19:07:08
查看原帖
全wa求助!!!
580129
kingofbashu楼主2022/7/21 14:03
#include<bits/stdc++.h>
using namespace std;
string name[1000];
int nian[1000],yue[1000],ri[1000];
int n;
int cishu[1000];
void jiaohuan(int i){
		string m;
		m=name[i];
		name[i]=name[i-1];
		name[i-1]=m;	
		int a;
		a=yue[i];
		yue[i]=yue[i-1];
		yue[i-1]=a;
		int b;
		b=nian[i];
		nian[i]=nian[i-1];
		nian[i-1]=b;	
		int c;
		c=ri[i];
		ri[i]=ri[i-1];
		ri[i-1]=c;
		int d;
		d=cishu[i];
		cishu[i]=cishu[i-1];
		cishu[i-1]=d;
} 
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>name[i]>>nian[i]>>yue[i]>>ri[i];
		cishu[i]=i;
	}	
	for(int i=1;i<n;i++){
		if(nian[i]<nian[i-1]){
			jiaohuan(i);
		}else if(yue[i]<yue[i-1]&&nian[i]==nian[i-1]){
			jiaohuan(i);	
		}else if(ri[i]<ri[i-1]&&yue[i]==yue[i-1]&&nian[i]==nian[i-1]){
			jiaohuan(i);
		}else if(nian[i]==nian[i-1]&&yue[i]==yue[i-1]&&ri[i]==ri[i-1]){
			if(cishu[i]<cishu[i-1]){
			jiaohuan(i);	
			}
		}
		
	}
	for(int i=0;i<n;i++){
		cout<<name[i];
	}
	return 0;
} 
2022/7/21 14:03
加载中...