class Solution:
    def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]:
        result = []
        for i in range(len(candies)):
            temp = candies.copy()
            temp[i] += extraCandies
            if max(temp) == temp[i]:
                result.append(True)
            else:
                result.append(False)

        return result

class Solution {
    public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
        List<Boolean> result = new ArrayList<>();
        int max = 0;
        for (int i = 0; i < candies.length; i++){
            int[] temp = candies.clone();
            temp[i] += extraCandies;
            max = temp[0];
            for (int j = 1;j < temp.length; j++) {
                if (temp[j] > max) {
                    max = temp[j];
                }
            }
            if (max == temp[i]){
                result.add(true);
            }
            else {
                result.add(false);
            }
        }
        return result;
    }
}

class Solution {
public:
    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
        vector<bool> result;
        int maxCandy = 0;
        for (int candy : candies){
            maxCandy = max(candy + extraCandies, candies);
        }
        for (int candy : candies){
            result.push_back(candy + extraCandies >= maxCandy);
        }
        return result;
    }
private:
    int max(int t, vector<int> candies){
        int max = candies[0];
        for (int i = 1; i < candies.size(); ++i) {
            if (candies[i] > max){
                max = candies[i];
            }
        }
        return max;
    }
};