Easy Python Solution
Code
# Code
```python3 []
class Solution:
    def maxScore(self, n: int, k: int, stayScore: List[List[int]], travelScore: List[List[int]]) -> int:
        dp = [[0] * n for _ in range(k + 1)]
        for i in range(1, k + 1):
            for j in range(n):
                stay = dp[i - 1][j] + stayScore[i - 1][j]
                move = -inf
                for prev in range(n):
                    move = max(move, dp[i - 1][prev] + travelScore[prev][j])
                dp[i][j] = max(stay, move)
        return max(dp[k])
```
['Python3']