UVA-1368 DNA Consensus String

#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
#include <string.h>
#include <stack>
#include <unordered_map>
#include <math.h>
#include <iomanip>

using namespace std;

int main()
{
    int T;
    cin >> T;
    while(T --)
    {
        int m,n;
        cin >> m >> n;
        char wordList[m+3][n+3];

        for(int i = 0; i < m; i ++)
        {
            for(int j = 0; j < n; j ++)
            {
                cin >> wordList[i][j];
            }
        }

        string strResult;
        int sumResult = 0;
        for(int i = 0; i < n; i ++)
        {
            int A = 0,T = 0,C = 0,G = 0;
            for(int j = 0; j < m; j ++)
            {
                if(wordList[j][i] == 'A')
                    A ++;
                else if(wordList[j][i] == 'T')
                    T ++;
                else if(wordList[j][i] == 'C')
                    C ++;
                else if(wordList[j][i] == 'G')
                    G ++;
            }
            
            if(A>=T && A>=C && A>=G)
            {
                sumResult += T+C+G;
                strResult += 'A';
            }
            else if(C>=T && C>=A && C>=G)
            {
                sumResult += A+T+G;
                strResult += 'C';
            }
            else if(G>=T && G>=A && G>=C)
            {
                sumResult += T+C+A;
                strResult += 'G';
            }
            else if(T>=A && T>=C && T>=G)
            {
                sumResult += A+C+G;
                strResult += 'T';
            }
        }
        cout << strResult << endl;
        cout << sumResult << endl;
    }
    return 0;
}