Minimum Path Sum

In an R x C grid of non-negative numbers, find the path from the top-left to the bottom-right (moving only right or down) with the smallest sum.

1 <= R, C <= 200 0 <= value <= 200