poj1007

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
struct ll
{
int num;
int num1;
string s;
}a[105];
bool cmp(struct ll x,struct ll y)
{
if(x.num!=y.num)
return x.num<y.num;
else
return x.num1<y.num1;
}
int process(string s)
{
int ans=0;
int A=0,C=0,G=0,T=0;
for(int i=s.length()-1;i>=0;i--)
{
switch(s[i])
{
case 'A':
A++;
break;
case 'C':
C++;
ans += A;
break;
case 'G':
G++;
ans += A+C;
break;
case 'T':
ans += A+C+G;
}
}
return ans;
}
int main()
{
int n,m;
while(cin>>n>>m)
{
for(int i=0;i<m;i++)
{
cin>>a[i].s;
a[i].num=process(a[i].s);
a[i].num1=i;
}
sort(a,a+m,cmp);
for(int i=0;i<m;i++)
{
cout<<a[i].s<<endl;
}
}
return 0;
}