Leet-Code-prog/Easy/kids_with_greatest_number_of_candies_1431/Solution.cpp

class Solution {
public:
    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
        int csize = candies.size();
        int i = 0;
        int current;
        int max = *std::max_element(candies.begin(), candies.end());

        vector<bool> kids;

        for (; i < csize; i++)
        {
            current = candies[i] + extraCandies;
            if (max <= current)
            {
                kids.push_back(true);
            }
            else
            {
                kids.push_back(false);
            }
        }
        return kids;
    }
};