@[BlackJiang](/user/339826) cmp有出把y打成x
by 褚橙 @ 2021-10-12 23:12:12
if(r[x].day == r[x].day)
by 褚橙 @ 2021-10-12 23:12:39
@[BlackJiang](/user/339826) 改一下就AC了
by 褚橙 @ 2021-10-12 23:13:09
Thank you very much!!!
by BlackJiang @ 2021-10-13 19:36:22
_node:_
```
#include<bits/stdc++.h>
using namespace std;
struct node{
string id;
int y,m,d;
};
bool cmp(node x,node y){
if(x.y!=y.y)
return x.y<y.y;
if(x.m!=y.m)
return x.m<y.m;
if(x.d!=y.d)
return x.d<y.d;
return x.id>y.id;
}
int main(){
int n;
node a[105];
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i].id>>a[i].y>>a[i].m>>a[i].d;
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++)
cout<<a[i].id<<"\n";
return 0;
}#include<bits/stdc++.h>
using namespace std;
struct node{
string id;
int y,m,d;
};
bool cmp(node x,node y){
if(x.y!=y.y)
return x.y<y.y;
if(x.m!=y.m)
return x.m<y.m;
if(x.d!=y.d)
return x.d<y.d;
return x.id>y.id;
}
int main(){
int n;
node a[105];
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i].id>>a[i].y>>a[i].m>>a[i].d;
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++)
cout<<a[i].id<<"\n";
return 0;
}#include<bits/stdc++.h>
using namespace std;
struct node{
string id;
int y,m,d;
};
bool cmp(node x,node y){
if(x.y!=y.y)
return x.y<y.y;
if(x.m!=y.m)
return x.m<y.m;
if(x.d!=y.d)
return x.d<y.d;
return x.id>y.id;
}
int main(){
int n;
node a[105];
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i].id>>a[i].y>>a[i].m>>a[i].d;
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++)
cout<<a[i].id<<"\n";
return 0;
}
```
by lmyedison @ 2021-10-16 15:57:07