排序

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[1000];
int a[1000],i,k,sum;
int main()
{
while(scanf("%s",s)!=EOF)
{
k=0;
for(i=0;s[i]!='\0';)
{
if(s[i]=='5')
{
i++;
continue;
}
sum=0;
while(s[i]!='5' && s[i] != '\0')
{
sum=sum*10+s[i]-'0';
i++;
}
a[k++]=sum;
}
sort(a,a+k);
for(i=0;i<k;i++)
{
if(i==k-1)
printf("%d",a[i]);
else
printf("%d ",a[i]);
}
printf("\n");
// memset(s,0,sizeof(s));
}
// return 0;
}