min_cost.cpp

// A Naive recursive implementation
// of MCP(Minimum Cost Path) problem
#include <bits/stdc++.h>
using namespace std;

#define R 3
#define C 3

int min(int x, int y, int z);

// Returns cost of minimum cost path
// from (0,0) to (m, n) in mat[R][C]
int minCost(int cost[R][C], int m, int n)
{
	if (n < 0 || m < 0)
		return INT_MAX;
	else if (m == 0 && n == 0)
		return cost[m][n];
	else
		return cost[m][n]
			+ min(minCost(cost, m - 1, n - 1),
					minCost(cost, m - 1, n),
					minCost(cost, m, n - 1));
}

// 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 code
int main()
{
	int cost[R][C]
		= { { 1, 2, 3 }, { 4, 8, 2 }, { 1, 5, 3 } };

	cout << minCost(cost, 2, 2) << endl;

	return 0;
}