From 036f3b7f5d6d23d88549c7eaf132fb0c815ba339 Mon Sep 17 00:00:00 2001
From: Eatswap <root@eatswap.org>
Date: Mon, 17 Apr 2023 11:34:05 +0800
Subject: [PATCH] add: 230417

---
 cpp/2304/230417.cpp     | 23 +++++++++++++++++++++++
 cpp/2304/CMakeLists.txt |  2 +-
 2 files changed, 24 insertions(+), 1 deletion(-)
 create mode 100644 cpp/2304/230417.cpp

diff --git a/cpp/2304/230417.cpp b/cpp/2304/230417.cpp
new file mode 100644
index 0000000..f8041cd
--- /dev/null
+++ b/cpp/2304/230417.cpp
@@ -0,0 +1,23 @@
+#include <iterator>
+#include <vector>
+#include <algorithm>
+
+/**
+ * 1431. Kids With the Greatest Number of Candies
+ *
+ * There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have.
+ * Return a boolean array result of length n, where result[i] is true if, after giving the ith kid all the extraCandies, they will have the greatest number of candies among all the kids, or false otherwise.
+ * Note that multiple kids can have the greatest number of candies.
+ */
+
+class Solution {
+public:
+	static std::vector<bool> kidsWithCandies(const std::vector<int>&, int);
+};
+
+std::vector<bool> Solution::kidsWithCandies(const std::vector<int>& c, int ec) {
+	std::vector<bool> ret;
+	int max = *std::max_element(c.begin(), c.end());
+	std::transform(c.begin(), c.end(), std::back_inserter(ret), [&](int x) { return x + ec >= max; });
+	return ret;
+}
diff --git a/cpp/2304/CMakeLists.txt b/cpp/2304/CMakeLists.txt
index 918cef6..5ec356d 100644
--- a/cpp/2304/CMakeLists.txt
+++ b/cpp/2304/CMakeLists.txt
@@ -4,4 +4,4 @@ PROJECT(2304)
 SET(CMAKE_CXX_STANDARD 23)
 SET(CMAKE_EXPORT_COMPILE_COMMANDS true)
 
-ADD_EXECUTABLE(2304 230414.cpp)
+ADD_EXECUTABLE(2304 230417.cpp)