FastPrep
Problem · Greedy

Effective Manager

Learn this problem
● MediumAkuna CapitalINTERNOA

Problem statement

A product manager has to organize n meetings with different people. Meeting with each person results in an increase or decrease in the effectiveness index of the manager. The manager wants to organize the meetings such that the index remains positive for as many meetings as possible. Find the maximum number of meetings for which the effectiveness index is positive. The index at the beginning is 0.

Note: After the meetings begin, the index must remain above 0 to be positive.

Function

maxMeetings(effectiveness: int[]) → int

Complete the function maxMeetings in the editor.

maxMeetings has the following parameter:

  1. int effectiveness[n]: the increase or decrease effectiveness for each meeting.

Returns

int: the maximum possible number of meetings while maintaining a positive index

🐳 ♫⋆｡♪ ₊˚♬ ﾟCredit to robotᯓᡣ𐭩

Examples

Example 1

effectiveness = [1, -20, 3, -2]return = 3
One optimal meeting order is [3, -2, 1, -20]. The index is positive for the first three meetings, after which it is 3 - 2 + 1 = 1. So, the answer is 3. There is no way to have 4 meetings with a positive index.

Constraints

  • 1 <= n <= 10^5
  • -10^9 <= effectiveness[i] <= 10^9

    • More Akuna Capital problems

    drafts saved locally
    public int maxMeetings(int[] effectiveness) {
  // write your code here
}
    effectiveness[1, -20, 3, -2]
    expected3
    checking account