Maximum Points After Enemy Battles

Explore greedy algorithm strategies to maximize points in a game scenario by optimally selecting enemies based on current energy. This lesson helps you understand trade-offs between energy usage and point accumulation to solve interval optimization problems effectively.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

Statement

You are given an integer array enemyEnergies where each element represents the energy value of an enemy, and an integer currentEnergy representing your initial energy.

You start with $0$ points, and all enemies are initially unmarked. You may perform either of the following operations any number of times to accumulate points:

Operation 1 — Choose an unmarked enemy i such that currentEnergy >= enemyEnergies[i]:

Your points increase by $1$ .
Your energy decreases: currentEnergy = currentEnergy - ...