POJ 1007

/*
 * poj_1007.c
 * accepted
 */
#include <stdio.h>
#include <stdlib.h>
#define N (50)
#define M (100)

static void poj_1007 ();
static int get_inversions (const char * str);
static int compar_st (const void * p, const void * q);

struct st{
    char str[N+1];
    int inv;
};

int main (int argc, char * argv[]){
    poj_1007 ();
    return 0;
}

static void poj_1007 (){
    int i, n, m;
    struct st s[M];

    scanf ("%d%d", &n, &m);
    for (i = 0; i < m; i ++){
        scanf ("%s", s[i].str);
        s[i].inv = get_inversions (s[i].str);
    }

    qsort (s, m, sizeof (struct st), compar_st);

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

static int get_inversions (const char * str){
    int r = 0;
    const char *p, *q;
    for (p = str; *p != '\0'; p ++){
        for ( q = p + 1; *q != '\0'; q ++){
            if (*p > *q){
                r ++;
            }
        }
    }
    return r;
}

static int compar_st ( const void * p, const void * q){
    return ((*(struct st *)p).inv - (*(struct st *)q).inv);
}