Add New Problem: Maximum Sum Path in Two Sorted Arrays with Solution

I would like to contribute a new problem statement and its solution to the project. Below are the details:

Problem Statement:
Given two sorted arrays of distinct integers, arr1 and arr2, each array may have some elements in common. The task is to find the maximum sum of a path from the beginning of any array to the end of any array. The twist is that you can switch from one array to another array only at the common elements. When switching, consider the common element only once in the result.

Please accept my PR and label it as `hacktoberfest-accepted` if my contribution is relevant.

まず、リポジトリ内の既存の問題エントリとコントリビューションの規約を調べ、問題文と C++ ソリューションを配置する場所を確認します。確立された形式で maximum-sum-path 問題とそのソリューションを追加し、リポジトリに既存の実行またはチェック方法を使って検証します。

索引モデルが issue の本文から書いたものです。