Given a cost matrix cost[][] and a position (m, n) in cost[][], write a function that returns cost of minimum cost path to reach (m, n) from (0, 0). Each cell of the matrix represents a cost to traverse through that cell. Total cost of a path to reach (m, n) is sum of all the costs on that path (including both source and destination). You can only traverse down, right and diagonally lower cells from a given cell, i.e., from a given cell (i, j), cells (i+1, j), (i, j+1) and (i+1, j+1) can be traversed. You may assume that all costs are positive integers.

For example, in the following figure, what is the minimum cost path to (2, 2)?

The path with minimum cost is highlighted in the following figure. The path is (0, 0) –> (0, 1) –> (1, 2) –> (2, 2). The cost of the path is 8 (1 + 2 + 2 + 3).

`/* Dynamic Programming implementation of MCP problem */` `#include <limits.h> ` `#include <stdio.h> ` `#define R 3 ` `#define C 3 ` ` ` `int` `min(` `int` `x, ` `int` `y, ` `int` `z); ` ` ` `int` `minCost(` `int` `cost[R][C], ` `int` `m, ` `int` `n) ` `{ ` ` ` `int` `i, j; ` ` ` ` ` `// Instead of following line, we can use int tc[m+1][n+1] or ` ` ` `// dynamically allocate memoery to save space. The following line is ` ` ` `// used to keep te program simple and make it working on all compilers. ` ` ` `int` `tc[R][C]; ` ` ` ` ` `tc[0][0] = cost[0][0]; ` ` ` ` ` `/* Initialize first column of total cost(tc) array */` ` ` `for` `(i = 1; i <= m; i++) ` ` ` `tc[i][0] = tc[i - 1][0] + cost[i][0]; ` ` ` ` ` `/* Initialize first row of tc array */` ` ` `for` `(j = 1; j <= n; j++) ` ` ` `tc[0][j] = tc[0][j - 1] + cost[0][j]; ` ` ` ` ` `/* Construct rest of the tc array */` ` ` `for` `(i = 1; i <= m; i++) ` ` ` `for` `(j = 1; j <= n; j++) ` ` ` `tc[i][j] = min(tc[i - 1][j - 1], ` ` ` `tc[i - 1][j], ` ` ` `tc[i][j - 1]) ` ` ` `+ cost[i][j]; ` ` ` ` ` `return` `tc[m][n]; ` `} ` ` ` `/* A utility function that returns minimum of 3 integers */` `int` `min(` `int` `x, ` `int` `y, ` `int` `z) ` `{ ` ` ` `if` `(x < y) ` ` ` `return` `(x < z) ? x : z; ` ` ` `else` ` ` `return` `(y < z) ? y : z; ` `} ` ` ` `/* Driver program to test above functions */` `int` `main() ` `{ ` ` ` `int` `cost[R][C] = { { 1, 2, 3 }, ` ` ` `{ 4, 8, 2 }, ` ` ` `{ 1, 5, 3 } }; ` ` ` `printf` `(` `" %d "` `, minCost(cost, 2, 2)); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

**Output:**

8

Please refer complete article on Dynamic Programming | Set 6 (Min Cost Path) for more details!

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Java Program for Min Cost Path
- Python Program for Min Cost Path
- Min Cost Path | DP-6
- Minimum Cost Path with Left, Right, Bottom and Up moves allowed
- Minimum odd cost path in a matrix
- Minimum cost path in a Matrix by moving only on value difference of X
- Maximum cost path in an Undirected Graph such that no edge is visited twice in a row
- C / C++ Program for Dijkstra's shortest path algorithm | Greedy Algo-7
- Remove minimum elements from either side such that 2*min becomes more than max
- Min number of operations to reduce N to 0 by subtracting any digits from N
- Convert 1 into X in min steps by multiplying with 2 or 3 or by adding 1
- Minimum removals from array to make max - min <= K
- Minimum Cost Polygon Triangulation
- Find the minimum cost to reach destination using a train
- Find minimum adjustment cost of an array
- Minimum Cost To Make Two Strings Identical
- Minimum cost to fill given weight in a bag
- Minimum cost to sort strings using reversal operations of different costs
- Minimum cost to make two strings identical by deleting the digits
- Minimum cost to make Longest Common Subsequence of length k