Sum of Largest Special Scores

Background

Congcong is currently exploring special numbers within arrays. He is interested in efficiently finding specific values in an array.

Problem Description

Given two arrays, $A$ and $B$, of non-negative integer scores. A "special" score is one which is a multiple of $10$, such as $40$ or $90$. Return the sum of the largest special score in $A$ and the largest special score in $B$. To practice decomposition, write a separate helper method which finds the largest special score in an array. Write your helper method after your scoresSpecial() method.

Input Format

Input is given from standard input in the following format.

Two arrays, $A$ and $B$. Each array's elements are space-separated and enclosed in square brackets [], with the two arrays also separated by a space.

Output Format

Output to standard output in the following format.

An integer, representing the sum of the largest special scores from both arrays.

Sample

[12 10 4] [2 20 30]

40

[20 10 4] [2 20 10]

40

[12 11 4] [2 20 31]

20

Sample Explanation

Sample 1: The largest special score in array $A = [12, 10, 4]$ is $10$. The largest special score in array $B = [2, 20, 30]$ is $30$. Their sum is $10 + 30 = 40$.

Sample 2: The largest special score in array $A = [20, 10, 4]$ is $20$. The largest special score in array $B = [2, 20, 10]$ is $20$. Their sum is $20 + 20 = 40$.

Sample 3: Array $A = [12, 11, 4]$ has no special scores, so the largest special score is $0$. The largest special score in array $B = [2, 20, 31]$ is $20$. Their sum is $0 + 20 = 20$.

Constraints

Time limit: $1$ second, Memory limit: $1024$ KiB for each test case.