这道字符串也处理了很多麻烦的情况啊啊啊啊啊，感觉字符串的问题都很注重细节（其实这是一道简单模拟吧。。。），可能是找错了方法，这道题又做了四十分钟左右。。。好难受明明是一道水题结果一直在Debuuuuuug。。先想好思路再下手，效果一定会好很多。。这紫书给的题真的要吐槽一下子，说是难题吧思路简单，说是水题呢半天敲不出来，自己功底太弱，加油码！
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<time.h>
using namespace std;
#define inf 0x3f3f3f3f
char a[52][1005];
int main()
{
int n, m;
int t;
scanf("%d",&t);
int num[4];
while(t --)
{
scanf("%d%d",&n,&m);
for(int i = 0; i < n; i ++)
scanf("%s",a[i]);
char ans[1005];
char ans1;
int ans2 = 0;
int maxy = -1;
for(int i = 0; i < m; i ++)
{
memset(num, 0, sizeof(num));
maxy = -1;
for(int j = 0; j < n; j ++)
{
if(a[j][i] == 'A')
{
num[0] ++;
if(num[0] >= maxy)
{
maxy = num[0];
ans1 = 'A';
}
}
if(a[j][i] == 'C')
{
num[1] ++;
if(num[1] == num[0]){}
else if(num[1] >= maxy)
{
maxy = num[1];
ans1 = 'C';
}
}
if(a[j][i] == 'G')
{
num[2] ++;
if((num[2] == num[1]) || (num[2] == num[0])){}
else if(num[2] >= maxy)
{
maxy = num[2];
ans1 = 'G';
}
}
if(a[j][i] == 'T')
{
num[3] ++;
if((num[3] == num[2]) || (num[3] == num[0]) || (num[3] == num[1])){}
else if(num[3] >= maxy)
{
maxy = num[3];
ans1 = 'T';
}
}
}
ans2 += (n - maxy);
ans[i] = ans1;
}
for(int i = 0; i < m; i ++)
cout<<ans[i];
cout<<endl;
printf("%d\n",ans2);
}
return 0;
}