백준 1932 c++

#include <iostream>
#include <algorithm>

using namespace std;

int** triangle;
//int triangle[501][501];

int input(int lower, int upper)
{
	//cout << "input()" << endl;
	int A;

	while (1)
	{
		cin >> A;
		if (A >= lower && A <= upper)
		{
			break;
		}
		else
		{
			;
		}
	}

	return A;
}

//void input_arr(int** triangle, int N)
void input_arr(int N)
{
	//cout << "input_arr()\n";
	int i, j;

	for (i = 0; i < N; i++)
	{
		for (j = 0; j <= i; j++)
		{
			triangle[i][j] = input(0, 9999);
		}
	}

	return;
}

//int find_result(int** triangle, int N)
int find_result(int N)
{
	//cout << "find_result()\n";
	int i, j;

	for (i = N-1; i >= 1; i--)
	{
		for (j = 0; j < i; j++)
		{
			triangle[i - 1][j] += max(triangle[i][j], triangle[i][j + 1]);
		}
	}

	return triangle[0][0];
}

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int N, i, j = 0;

	N = input(1, 500);
	triangle = new int*[N];
	for (i = 0; i < N; i++)
	{
		/*for (j = 0; j <= i; j++)
		{
			triangle[i] = new int[j + 1];
		}*/
		triangle[i] = new int[j + 1];
		j++;
	}
	//input_arr(triangle, N);
	input_arr(N);
	//cout << find_result(triangle, N) << "\n";
	cout << find_result(N) << "\n";
	for (i = 0; i < N; i++)
	{
		delete[] triangle[i];
	}
	delete[] triangle;

	return 0;
}