public class Z75 { public static int solution(int[] arr, int target) { int count = 0; int[] result = new int[arr.length]; Arrays.fill(result, -1); for (int i = 0; i < arr.length; i++) { boolean[] isUsed = new boolean[arr.length]; if (canSelected(arr, i, result, isUsed, target)) { count++; } } for (int i= 0; i < arr.length; i++) { if (arr[i] >= target && result[i] == -1) { count++; } } return count; } public static boolean canSelected(int[] arr, int i, int[] result, boolean[] isUsed, int target) { for (int j = 0; j < arr.length; j++) { if (i == j) { continue; } if (isUsed[j]) { continue; } if (arr[i] + arr[j] < target) { continue; } if (result[j] == -1) { result[i] = j; result[j] = i; return true; } int nextI = result[j]; if (nextI == i) { return false; } isUsed[j] = true; isUsed[i] = true; if (canSelected(arr, nextI, result, isUsed, target)) { result[i] = j; result[j] = i; return true; } } return false; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = sc.nextInt(); } int m = sc.nextInt(); System.out.println((solution(arr, m))); } }
点赞 评论

相关推荐

2025-12-15 11:27
门头沟学院 Java
哇哇的菜鸡oc:所有人不要理会,就好了,后面他就知道怎么回事了,只能说有的时候市场都是被宰的人搞坏的
点赞 评论 收藏
分享
01-26 19:51
门头沟学院 Java
点赞 评论 收藏
分享
牛客网
牛客网在线编程
牛客网题解
牛客企业服务