第一！

#include <bits/stdc++.h>
using namespace std;
bool cmp(int x,int y){
    return x>y;
}
int main(){
    int n;
    cin>>n;
    int a[n+1],b[n+1],c[n+1],b1=0,c1=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        int num=0;
        int h=a[i];
        while(h!=0){
            h/=10;
            num++;
        }
        if(num%2==1||a[i]==0){
            b1++;
            b[b1]=a[i];
        }else{
            c1++;
            c[c1]=a[i];
        }
    }
    sort(b+1,b+b1+1);
    sort(c+1,c+c1+1,cmp);
    for(int i=1;i<=b1;i++){
        cout<<b[i]<<" ";
    }
    for(int i=1;i<=c1;i++){
        cout<<c[i]<<" ";
    }
    return 0;
}

要解析的就点个赞吧
骗罐头也行