Mandragora Forest in HackerRank

MandragoraForest.java

import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int i = 0; i < t; i++) {
            int n = in.nextInt();
            long [] array = new long [n];
            for (int j = 0; j < n; j++) {
                array[j] = in.nextLong();
            }
            Arrays.sort(array);
            for (int j = 1; j < n; j++) {
                array[j] += array[j - 1];
            }
            long max = array[n - 1];
            for (int j = 0; j < n; j++) {
                max = Math.max(max, (array[n - 1] - array[j]) * (j + 2));
            }
            System.out.println(max);
        }
        in.close();
    }
}