Ten Thousand Empty Cases

The constraint block reads:

1 <= t <= 10^4                       (number of test cases)
1 <= n <= 2*10^5                     (array length in one case)
the sum of n over all test cases does not exceed 2*10^5

Your per-case algorithm is $O(n \log n)$. What is your real budget, and where is the risk?