длинная арифметика сложение

#include <iostream>
#include <string>
int main()
{
	using namespace std;

	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);

	int n, m, max;
	int f = 1;
	cin >> n >> m;

	int maxik;
	if (m >= n)
	{
		maxik = m;
	}
	else
	{
		maxik = n;
	}

	int *mas = new int[maxik + 2];
	int *arr = new int[maxik + 2];
	int *ans = new int[maxik + 2];

	mas[0] = 0;
	arr[0] = 0;
	ans[0] = -1;
	if (n >= m)
	{
		for (int i = 1;i <= n;i++)
		{
			cin >> mas[i];
		}
		for (int i = (n - m + 1);i <= n;i++)
		{
			cin >> arr[i];
		}
		for (int i = 1;i < (n - m + 1);i++)
		{
			arr[i] = 0;
		}
		max = n;
	}
	else
	{
		for (int i = 1;i < (m - n + 1);i++)
		{
			mas[i] = 0;
		}
		for (int i = (m - n + 1);i <= m;i++)
		{
			cin >> mas[i];
		}
		for (int i = 1;i <= m;i++)
		{
			cin >> arr[i];
		}
		max = m;
	}





	for (int i = max;i > 0;i--)
	{
		ans[i] = mas[i] + arr[i];
	}

	for (int i = max;i > 0;i--)
	{
		if (ans[i] >= 10)
		{
			ans[i - 1] += ans[i] / 10;
			ans[i] %= 10;
		}

	}

	if (ans[0] != -1)
		ans[0] = 1;

	for (int i = 0;i <= max;i++)
	{
		if (ans[i] >= 0)
		{
			cout << ans[i];
		}
	}





}