int j=0;//排序.
    for(j=0;j<=(strlen(price)-1);j++)
    {
        int smallest;
        smallest=j;
        int k=0;
        int temp;
        for(k=j+1;k<=(strlen(price)-1);k++)
        {
            if(price[k]<price[smallest])
            {
                temp=price[k];
                price[k]=price[smallest];
                price[smallest]=temp;
            }