[C++] HackerRank 해커랭크 Flipping the Matrix

문제링크 : https://www.hackerrank.com/challenges/flipping-the-matrix

#include <bits/stdc++.h>
using namespace std;
 
int main() {
    int queries; // 1 <= q <= 16
    int n;       // 1 <= n <= 128
    
    cin >> queries;
    
    for(int q = 0; q < queries; q++){
        cin >> n;
        long int** matrix = new long int*[2*n];
        for(int i = 0; i < 2*n; i++)
            matrix[i] = new long int[2*n];
        
        for(int i = 0; i < 2*n; i++)
            for(int j = 0; j < 2*n; j++)
                cin >> matrix[i][j];
        
        long int sum = 0;
        for(int i = 0; i < n; i++)
            for(int j = 0; j < n; j++){
                sum += max(matrix[i][j],
                max(matrix[i][2*n-1-j],
                max(matrix[2*n-1-i][j],
                matrix[2*n-1-i][2*n-1-j])));
            }
        cout << sum << endl;
    }
    return 0;
}