minimumCostPath.java

import java.util.*; 

public class MinimumCostPath 
{ 
	
	private static int min(int x, int y, int z) 
	{ 
		if (x < y) 
			return (x < z)? x : z; 
		else
			return (y < z)? y : z; 
	} 

	private static int minCost(int cost[][], int m, int n) 
	{ 
		int i, j; 
		int tc[][]=new int[m+1][n+1]; 

		tc[0][0] = cost[0][0]; 

		for (i = 1; i <= m; i++) 
			tc[i][0] = tc[i-1][0] + cost[i][0]; 

	
		for (j = 1; j <= n; j++) 
			tc[0][j] = tc[0][j-1] + cost[0][j]; 

	
		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]; 
	} 


	public static void main(String args[]) 
	{ 
		int cost[][]= {{348,391},{618,193}}; 
		System.out.println(minCost(cost,1,1)); 
	} 
}