## Problem Link:

## Difficulty:

CakeWalk

## Problem:

Find the minimum amount to purchase all types of stones.

## Explanation:

The input is **N*N** matrix. We can consider it as **N** different arrays. We just need to add the minimum of every array. This is our required answer. We can do it by inputting one array at a time and finding the minimum of the array and then input the next array.

## Solution:

Author’s Solution can be found here.