← All problemsSign in

3645. Maximum Total from Optimal Activation Order

LeetCodeArrayTwo PointersGreedySortingHeap (Priority Queue)Open on judge ↗

You are given two integer arrays value and limit, both of length n. Initially, all elements are inactive. You may activate them in any order. - To activate an inactive element at index i, the number of currently active elements must be strictly less than limit[i]. - When you activate the element at index i, it adds value[i] to the total activation value (i.e., the sum of value[i] for all elemen

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

Sign in to chat with the tutor and save your progress.

Sign in to start