Minimum Cost Path with Teleportations

You are given a m x n integer grid grid and an integer k.
You start from the top-left cell (0, 0) and must reach the bottom-right cell (m - 1, n - 1).
There are two types of moves allowed:
1. Normal Move:
o You can move right or down from your current position (i, j)
o The cost is the value of the destination cell
2. Teleport Jump:
o You can teleport from any cell (i, j) to any other cell (x, y) if grid[x][y] <= grid[i][j].
o The cost of teleportation is 0.
o You can teleport at most k times.
Your task is to find the minimum total cost to reach the cell (m - 1, n - 1) starting from (0, 0).