LeetCode 1431. 拥有最多糖果的孩子

class Solution {
public:
    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
        int n = candies.size();
        int maxC = *max_element(candies.begin(), candies.end());
        vector<bool> res;
        for(int i = 0; i < n; ++i){
            res.push_back(candies[i] + extraCandies >= maxC);
        }
        return res;
    }
};