prob 1007 排序算法

#include <stdio.h>
#include <stdlib.h>

char array[101][51];
int sort[100];

int main(int argc, char **argv)
{
        int n, m, i, j, k, key, pos;
        int res[100];

        scanf("%d %d", &n, &m);
        getchar();

        for(i = 0; i < m; i++){
                for(j = 0; j < n; j++){
                        scanf("%c", &array[i][j]);
                }
                getchar();
        }

        for(i = 0; i < m; i++){
                for(j = 0; j < n; j++){
                        for(k = j; k < n; k++){
                                if(array[i][j] > array[i][k]){
                                        sort[i]++;
                                }
                        }
                }
                res[i] = i;
        }//算逆序数

        for(j = 1; j < m; j++){
                i = j-1;
                key = sort[j];
                pos = res[j];
                while((key < sort[i]) && (i >= 0)){
                        sort[i+1] = sort[i];
                        res[i+1] = res[i];
                        i--;
                }
                sort[i+1] = key;
                res[i+1] = pos;
        }//插入排序

        for(i = 0; i < m; i++){
                printf("%s\n", array[res[i]]);
        }

        exit(0);
}