Biggest Number Formation Problem

Your task is to construct the largest number possible by concatenating each of the provided positive integers in the array exactly once.

Input:

Integer T denoting the number of test cases, followed by T test cases.
Each test case has:
An integer N which is the number of elements in the array.
N space-separated positive integers representing the array elements.

Output:

For each test case, output the largest possible number formed by concatenating the array elements.

Example:

Input:

1
3
9 98 7

Output:

9987

Constraints:

• 1 <= T <= 10
• 1 <= N <= 1000
• 0 <= A[i] <= 10⁹
• Time Limit: 1 sec

Note:

No output needs to be printed from your end as it is managed. Focus on implementing the function.