Dragons - Algorithm

Here's your approach:

$1.$ Read your initial strength $s$ and number of dragons $n$.

$2.$ Store each dragon as a pair (strength, bonus) in a vector.

$3.$ Sort the vector by dragon strength in ascending order.

$4.$ Loop through the sorted dragons.

$5.$ For each dragon, check if your current strength is greater than the dragon's strength.

$6.$ If yes, add the bonus to your strength and continue.

$7.$ If no, output "NO" and stop.

$8.$ If you defeat all dragons, output "YES". This solution combines sorting with sequential checking. You sort once, then process in order. The sort does the hard work of finding the right sequence for you.