Source Code

Problem: 1007  User: angrad 
Memory: 184K  Time: 16MS 
Language: C  Result: Accepted 

Source Code 
-----------------------------------------------

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

typedef struct record
{
	int index;
	int total;	
}record;


int cmp( const void *a ,const void *b) 
{ 
	return (*(record *)a).total > (*(record *)b).total ? 1 : -1; 
} 

int main()
{
	record sum[101];
	int n, m, i, j, k, count[101], min, index;
	char string[101][51];
	scanf("%d %d", &n, &m);
	memset(sum, 0, sizeof(sum));
	for(i=0; i<m; i++)
	{
		sum[i].index = i;
	}
	for(i=0; i<m; i++)
	{
		scanf("%s", string[i]);
		memset(count, 0, sizeof(count));
		for(j=0; j<n; j++)
		{
			if(j>0 && string[i][j]==string[i][j-1])
			{
				count[j] = count[j-1];
				sum[i].total += count[j];
				continue;
			}
			for(k=j+1; k<n; k++)
			{
				if(string[i][k] - string[i][j] < 0)
				{
					count[j]++;
				}	
			}
			sum[i].total += count[j];
		}
	}
	qsort(sum, m, sizeof(sum[0]), cmp); 
	for(i=0; i<m; i++)
	{
		printf("%s\n", string[sum[i].index]);
	}
	return 0;
}