hdu 1106 排序

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <cmath>
#include <map>

using namespace std;
typedef long long ll;

const double inf=1e20;
const int maxn=2e5+10;
const int mod=1e9+7;

char a[maxn];
ll num[maxn];

int main(){
    while(scanf("%s",a)!=EOF){
        ll j=0;
        ll sum=0;
        int len=strlen(a);
        for(int i=0;i<=len;i++){
            if(a[i]!=‘5‘&&a[i]!=‘\0‘){
                sum*=10;
                sum+=a[i]-‘0‘;
            }else{
                if(i>0&&a[i-1]!=‘5‘){
                    num[j++]=sum;
                    sum=0;
                }
            }
        }
        sort(num,num+j);
        for(int i=0;i<j;i++){
            if(i==0)
                printf("%lld",num[i]);
            else
                printf(" %lld",num[i]);
        }printf("\n");
    }
    return 0;
}