in java lanuage please You have been given two sorted arrays (in increasing order), find a path through the intersections that produces maximum sum and return the maximum sum. That is, you can switch from one array to another array only at common elements. If no intersection element is present, we need to take sum of all elements from the array with greater sum. Input Format: Line 1: Size of first array Line 2: Elements of first array Line 3: Size of second array Line 4: Elements of second array Output Format: The maximum sum Sample Input: 6 1 5 10 15 20 25 5 2 4 5 9 15 Sample Output: 81 Explanation: We will start from second array and take sum till 5 which will be equal to 11. Then we'll switch to first array because both arrays are intersecting at 5 so then we will start from element 10 and take till 15 and the sum will become 36. Now again both arrays are intersecting at 15 but there are no elements left in second array after 15, so we'll continue with first array. Hence sum will be 81. in java
in java lanuage please
You have been given two sorted arrays (in increasing order), find a path through the intersections
that produces maximum sum and return the maximum sum.
That is, you can switch from one array to another array only at common elements.
If no intersection element is present, we need to take sum of all elements from the array with greater
sum.
Input Format:
Line 1: Size of first array
Line 2: Elements of first array
Line 3: Size of second array
Line 4: Elements of second array
Output Format:
The maximum sum
Sample Input:
6
1 5 10 15 20 25
5
2 4 5 9 15
Sample Output:
81
Explanation:
We will start from second array and take sum till 5 which will be equal to 11. Then we'll switch to
first array because both arrays are intersecting at 5 so then we will start from element 10 and take till
15 and the sum will become 36. Now again both arrays are intersecting at 15 but there are no
elements left in second array after 15, so we'll continue with first array. Hence sum will be 81. in java
Step by step
Solved in 2 steps with 1 images
