Add solution #3462

Author: JoshCrozier

README.md

@@ -843,6 +843,7 @@
 3402|[Minimum Operations to Make Columns Strictly Increasing](./3402-minimum-operations-to-make-columns-strictly-increasing.js)|Easy|
 3452|[Sum of Good Numbers](./3452-sum-of-good-numbers.js)|Easy|
 3461|[Check If Digits Are Equal in String After Operations I](./3461-check-if-digits-are-equal-in-string-after-operations-i.js)|Easy|
+3462|[Maximum Sum With at Most K Elements](./3462-maximum-sum-with-at-most-k-elements.js)|Medium|
 
 ## License
 

solutions/3462-maximum-sum-with-at-most-k-elements.js

@@ -0,0 +1,26 @@
+/**
+ * 3462. Maximum Sum With at Most K Elements
+ * https://leetcode.com/problems/maximum-sum-with-at-most-k-elements/
+ * Difficulty: Medium
+ *
+ * You are given a 2D integer matrix grid of size n x m, an integer array limits of length n, and
+ * an integer k. The task is to find the maximum sum of at most k elements from the matrix grid
+ * such that:
+ * - The number of elements taken from the ith row of grid does not exceed limits[i].
+ *
+ * Return the maximum sum.
+ */
+
+/**
+ * @param {number[][]} grid
+ * @param {number[]} limits
+ * @param {number} k
+ * @return {number}
+ */
+var maxSum = function(grid, limits, k) {
+  const result = [];
+  grid.forEach((row, i) => {
+    result.push(...row.slice().sort((a, b) => b - a).slice(0, limits[i]));
+  });
+  return result.sort((a, b) => b - a).slice(0, k).reduce((sum, num) => sum + num, 0);
+};