蓝桥杯 2021//11/3 Huffman树

import java.util.Comparator;
import java.util.Scanner;
import java.util.ArrayList;
public class Main {
    public static void main(String[] args) {
        int sum=0;
        int count=0;
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        ArrayList<Integer> arr=new ArrayList<>();
        for(int i=0;i<n;i++){
            arr.add(sc.nextInt());
        }
        while(arr.size()>1){
            arr.sort(Comparator.naturalOrder());
            count=arr.get(0)+arr.get(1);
            sum=sum+count;
            arr.remove(0);arr.remove(0);
            arr.add(count);
        }
        System.out.println(sum);
    }
}

ArrayList:大小可变的数组。

while{}可简写：

count=arr.remove(0)+arr.remove(0);