@@ -0,0 +1,16 @@
+class Solution {
+public int constrainedSubsetSum(int[] nums, int k) {
+PriorityQueue<int[]> pq = new PriorityQueue<>((a, b) -> b[0] - a[0]);
+pq.add(new int[]{nums[0], 0});
+int result = nums[0];
+for (int i = 1; i < nums.length; i++) {
+while (i - pq.peek()[1] > k) {
+pq.remove();
+}
+int curr = Math.max(0, pq.peek()[0]) + nums[i];
+result = Math.max(result, curr);
+pq.add(new int[]{curr, i});
+}
+return result;
+}
+}