leetcode.cn 2025-07-18
🔴2163.minimum-difference-in-sums-after-removal-of-elements
🏷️ Tags
#array #dynamic_programming #heap_priority_queue
🔴2163.minimum-difference-in-sums-after-removal-of-elements
🏷️ Tags
#array #dynamic_programming #heap_priority_queue
Telegraph
minimum-difference-in-sums-after-removal-of-elements
给你一个下标从 0 开始的整数数组 nums ，它包含 3 * n 个元素。 你可以从 nums 中删除 恰好 n 个元素，剩下的 2 * n 个元素将会被分成两个 相同大小 的部分。
leetcode.com 2025-07-18
🔴2163.minimum-difference-in-sums-after-removal-of-elements
🏷️ Tags
#array #dynamic_programming #heap_priority_queue
🔴2163.minimum-difference-in-sums-after-removal-of-elements
🏷️ Tags
#array #dynamic_programming #heap_priority_queue
Telegraph
minimum-difference-in-sums-after-removal-of-elements
You are given a 0-indexed integer array nums consisting of 3 * n elements. You are allowed to remove any subsequence of elements of size exactly n from nums. The remaining 2 * n elements will be divided into two equal parts: