#include <bits/stdc++.h>
using namespace std;
const int N=200010;
int a[N],b[N],c[N];
int q(int w){
int cnt=0;
while(w!=0){
w/=10;cnt++;
}
return cnt;}
int main() {
int n,j=1,k=1;cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
if(a[i]==0){b[j]=a[i];j++;}
else if(q(a[i])%2){b[j]=a[i];j++;}
else{c[k]=a[i];k++;}
}
sort(b+1,b+j+1);
sort(c+1,c+k+1);
for(int i=2;i<=j;i++) cout<<b[i]<<" ";
for(int i=k;i>1;i--) cout<<c[i]<<" ";
}
点个赞吧！！！
