华为OD机试-王者荣耀-DFS（JAVA 2025A卷）

import java.util.*;
public class King {
    private static int minDifference = Integer.MAX_VALUE; // 存储最小的差值

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] scores = Arrays.stream(sc.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
        boolean[] visited = new boolean[scores.length];
        dfs(scores, visited, 0, 5);
        System.out.println(minDifference);
    }

    // 使用递归来枚举所有可能的5人组合
    private static void dfs(int[] scores, boolean[] visited, int start, int k) {
        int totalSum = Arrays.stream(scores).sum();
        if (k == 0) {
            // 一旦选择了5人，计算这5人的评分总和
            int team1Sum = 0;
            for (int i = 0; i < scores.length; i++) {
                if (visited[i]) {
                    team1Sum += scores[i];
                }
            }
            int team2Sum = totalSum - team1Sum;
            minDifference = Math.min(minDifference, Math.abs(team1Sum - team2Sum));
            return;
        }
        for (int i = start; i < scores.length; i++) {
            visited[i] = true;
            dfs(scores, visited, i + 1, k - 1);
            visited[i] = false; // 回溯
        }
    }
}