给你一个长度为n的序列,你每次可以将一个序列分割成两个连续的的子序列,
import java.util.Arrays;
import java.util.Scanner;
/*
* https://www.nowcoder.com/acm/contest/17/A
* */
public class Cut {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n =sc.nextInt();
double[] data=new double[n];
long sum=0;
for(int i = 0; i<n;i++) {
data[i]=sc.nextInt();
sum+=data[i];
}
Arrays.sort(data);
long result=0;
for(int i=0;i<n-1;i++) {
result += sum;
sum-=data[i];
}
System.out.println(result);
}
}