leetcode

0 class Solution {

1 public:

2 vector<bool> kidsWithCandies(vector<int> &candies, int extraCandies) {

3 int maxi = *max_element(candies.begin(), candies.end());

4 vector<bool> res(candies.size());

5 for (int i = 0; i < candies.size(); i++)

6 res[i] = (maxi - candies[i]) <= extraCandies;

7 return res;

8 }

9 };