C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 2167번:2차원 배열의 합 답

#include <iostream>
using namespace std;
int main() {
    int N, M, K, i, j, x, y, sum;
    cin >> N >> M;
    int **arr = new int *[N];
    for (int i = 0; i < N; i++)
    {
        arr[i] = new int[M];
    }
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < M; j++)
        {
            cin >> arr[i][j];
            
        }
    }
    cin >> K;
    for (int a = 0; a < K; a++)
    {
        sum = 0;
 
        cin >> i >> j >> x >> y;
        for (int t = i-1; t < x; t++)
        {
            for (int o = j-1; o < y; o++)
            {
                sum += arr[t][o];
            }
        }
        cout << sum << '\n';
    }
}