Sum of Two Highest Numbers

Given an array of n integers, your task is to find the sum of the two highest numbers. Let \( a \) and \( b \) be the two largest numbers in the array with \( a \geq b \). The answer to the problem is \( a + b \).

Note: The input will always contain at least two integers.

inputFormat

The first line contains a single integer \( n \) (where \( n \geq 2 \)), representing the number of integers. The second line contains \( n \) space-separated integers.

outputFormat

Output a single integer, the sum of the two highest numbers in the array.

5
1 2 3 4 5

9