You are given an array of positive integers nums of length n.

A polygon is a closed shape with at least $3$ sides. A valid polygon can be formed if and only if the longest side is strictly less than the sum of all its other sides.

The perimeter of a polygon is the sum of the lengths of all its sides.

Return the maximum possible perimeter of a polygon that can be formed using a subset of elements from nums. If it is impossible to form any polygon, return $-1$.

Constraints:

• $3 \leq$ n $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.