题解 | #组合游戏#

要求花费最少金币，所以每次都选取2个最小的木板进组合。

import java.io.*;

import java.util.*;

public class Main {

static Scanner sc = new Scanner(System.in);

static int n;

static long a;

public static void main(String[] args){
    while (sc.hasNext()) {
        long sum = 0;
        n = sc.nextInt();
        long[] arr = new long[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextLong();
        }
        sum = 0;
        int i = 0;
        while (i < n-1) {
            Arrays.sort(arr);
            a = arr[i] + arr[i+1];
            sum += a;
            arr[i] = 0;
            arr[i+1] = a;
            i ++;
        }
        System.out.println(sum);
    }
}

}