Problem Statement

Minimum Path Sum Given an m by n grid of non-negative integers, find the smallest path sum from the top-left to the bottom-right. You may move only right or down. Input Format The first line contains m and n. The next m lines contain the grid. Output Format Print the minimum path sum. Constraints - 1 <= m,n <= 200 - 0 <= each grid value <= 200