3961. Maximize Sum of Device Ratings

LeetCodeOpen on judge ↗

You are given a 2D integer array units of size m × n where units[i][j] represents the capacity of the jth unit in the ith device. Each device contains exactly n units. The rating of a device is the minimum capacity among all its units. You may perform the following operation any number of times (including zero): - Choose a device i that has not been used as a source before. - Remove exactly on

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI