#include <iostream>
int minPathSum(int (*arr)[10], const int &row, const int &col); //数组并不完全是指针,传参数需要注意
int main()
{
int arr[10][10], num, row = 0, col = 0;
std::cin >> row >> col;
for (int i = 0; i < row; ++i)
{
for (int j = 0; j < col; ++j)
{
std::cin >> num;
arr[i][j] = num;
}
}
//输入一个矩阵数组,求出从arr[0][0]到arr[row - 1][col - 1]的最短路径
int minPathSum(int (*arr)[10], const int &row, const int &col); //数组并不完全是指针,传参数需要注意
int main()
{
int arr[10][10], num, row = 0, col = 0;
std::cin >> row >> col;
for (int i = 0; i < row; ++i)
{
for (int j = 0; j < col; ++j)
{
std::cin >> num;
arr[i][j] = num;
}
}