hdu 1106 排序

#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>/*题目思路：1.输入数据          2.把分开的数分别存储进map[][]数组中  3.用字符串转数字函数把map[][]转化到num[]数组中  4.快速排序，然后输出结果 */using namespace std;int cmp(int a,int b){return a<b;}int main(){int num[1100];char str[1100],map[1100][30];memset(str,0,sizeof(str));memset(map,0,sizeof(map));while( scanf("%s",str)!=EOF ){int len=strlen(str);int i,j;for(i=0;i<len; ){if(str[i]=='5')i++;elsebreak;}int t,k;for(t=0,k=0,j=i;j<len;j++){if(str[j]=='5'&&j!=(len-1)&&str[j+1]!='5'){k=0;t++;}else if(str[j]!='5'){map[t][k]=str[j];k++;}}for(i=0;i<=t;i++){num[i]=atoi(map[i]);}sort(num,num+t+1,cmp);for(i=0;i<=t;i++){if(i==0)printf("%d",num[i]);else{printf(" %d",num[i]);}}printf("\n");memset(str,0,sizeof(str));    memset(map,0,sizeof(map));}return 0;}