You are an expert Python programmer. You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.

### Question:
You are given an m x n grid of non-negative integers. A robot starts at the top-left cell (0, 0) and must reach the bottom-right cell (m - 1, n - 1), moving only right or down. Each cell has a cost, and the robot pays the cost of every cell it enters, including the first and the last.
The robot may skip the cost of at most one cell on its path.
Return the minimum total cost of a path from the top-left cell to the bottom-right cell.

Example 1:

Input: grid = [[1,3,1],[1,5,1],[4,2,1]]
Output: 4
Explanation: The path 1 -> 3 -> 1 -> 1 -> 1 costs 7; skipping the 3 gives 4.

Example 2:

Input: grid = [[5]]
Output: 0

Constraints:

m == grid.length
n == grid[i].length
1 <= m, n <= 300
0 <= grid[i][j] <= 1000

### Format: You will use the following starter code to write the solution to the problem and enclose your code within delimiters.
```python
class Solution:
    def minCostWithSkip(self, grid: List[List[int]]) -> int:
        
```

### Answer: (use the provided format with backticks)

