poj 1007 归并+STL

#include<iostream>
#include<map>
#include<string>
#include<algorithm>
#include<fstream>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
using namespace std;
#define lch(i) ((i)<<1)
#define rch(i) ((i)<<1|1)
#define sqr(i) ((i)*(i))
#define pii pair<int,int>
#define mp make_pair
#define FOR(i,b,e) for(int i=b;i<=e;i++)
#define FORE(i,b,e) for(int i=b;i>=e;i--)
#define ms(a)   memset(a,0,sizeof(a))
const int maxnum =21252;
const  int  mod = 10007;
int n,m;

char le[51],ri[51];

int sortAndUnited(char *str,int r){//0~len-1
if(r==0) return 0;
int mid = r/2;
int sum=0;
sum+=sortAndUnited(str,mid);
sum+=sortAndUnited(str+mid+1,r-mid-1);
FOR(i,0,mid){
le[i]=str[i];
}
le[mid+1]='Z'+1;
FOR(i,mid+1,r){
ri[i-mid-1]=str[i];
}
ri[r-mid]='Z'+1;
int ple=0,pri=0;
FOR(i,0,r){
if(ri[pri]<le[ple]){
sum+=mid+1-ple;
str[i]=ri[pri];
pri++;
}else{
str[i]=le[ple];
ple++;
}
}
return sum;
}

int cmp(pair<string,int> a,pair<string,int> b){
return a.second<b.second;
}
//
//#define _DEBUG_ 1;

int main()
{
#ifdef _DEBUG_
fstream fin("G:/1.txt");
#else
#define fin cin
#endif
fin>>m>>n;
char tmp[51],cpy[51];
vector<pair<string,int>> vec;
FOR(i,1,n){
fin>>tmp;
strcpy(cpy,tmp);
vec.push_back(mp(cpy,sortAndUnited(tmp,m-1)));
}
sort(vec.begin(),vec.end(),cmp);
int size=vec.size();
FOR(i,0,size-1){
printf("%s\n",vec[i].first.c_str());
}
return 0;
}