✅ C++ very easy solution O(n), beats 100%
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int minNumberOfHours(int initialEnergy, int initialExperience, vector<int>& energy, vector<int>& experience) {
        const auto n = energy.size();
        int finalEnergy = initialEnergy;
        int finalExperience = initialExperience;
        int extraEnergy = 0;
        int extraExperience = 0;
        for (int i = 0; i < n; ++i) {

            const auto deltaEnergy = energy[i] - finalEnergy;
            if (deltaEnergy >= 0) {
                extraEnergy += deltaEnergy + 1;
                finalEnergy += deltaEnergy + 1;
            } 
            finalEnergy -= energy[i];
            
            const auto deltaExperience = experience[i] - finalExperience;
            if (deltaExperience >= 0) {
                extraExperience += deltaExperience + 1;
                finalExperience += deltaExperience + 1;
            } 
            finalExperience += experience[i];
            
        }
        return extraEnergy + extraExperience;
    }
};
```
['C++']