alicode44-最大边权和

package solution44;

import java.util.*;
class Solution {
    public int solution(int n,int[] nums) {
        Arrays.sort(nums);
        int maxVal = nums[n-1];
        int sums = 0;
        for(int i=0;i<n-1;i++){
            sums += (nums[i] + maxVal) / 2;
        }
        return sums;
    }
}

算法思路：数组排序。