aboutsummaryrefslogtreecommitdiff
path: root/max_candies_allocated_k_children.c
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-13 19:00:21 -0600
committerJack Sangdahl <[email protected]>2025-03-13 19:00:21 -0600
commitcfade6dd3a70110d02029610514b6f6cd3583034 (patch)
treeffc6be89835e01e73ba8bb06446cb13e32cebebe /max_candies_allocated_k_children.c
parenteb10e9d2f0a514f14285b3f701ab65b18c9d32a1 (diff)
downloadleetcode-cfade6dd3a70110d02029610514b6f6cd3583034.tar.gz
leetcode-cfade6dd3a70110d02029610514b6f6cd3583034.zip
2226. maximum candies allocated to k children
Diffstat (limited to 'max_candies_allocated_k_children.c')
-rw-r--r--max_candies_allocated_k_children.c32
1 files changed, 32 insertions, 0 deletions
diff --git a/max_candies_allocated_k_children.c b/max_candies_allocated_k_children.c
new file mode 100644
index 0000000..45f105c
--- /dev/null
+++ b/max_candies_allocated_k_children.c
@@ -0,0 +1,32 @@
+// 2226. Maximum Candies Allocated to K Children
+#include "leetcode.h"
+
+/*
+ * you are given a 0-indexed integer array 'candies'. each element in the array
+ * denotes a pile of candies of size 'candies[i]'. you can divide each pile into
+ * any number of sub piles, but you cannot merge two piles together. you are
+ * also given an integer 'k'. you should allocate piles of candies to 'k'
+ * children such that each child gets the same number of candies. each child can
+ * be allocated candies from only one pile of candies, and some piles of candies
+ * may go unused. return the maximum number of candies each child can get
+ */
+
+int maximumCandies(int *candies, int candiesSize, long long k) {
+ int l = 0, r = 1e7;
+ while (l < r) {
+ long long mid = (l + r + 1) / 2, cnt = 0;
+ for (int i = 0; i < candiesSize && cnt < k; ++i)
+ cnt += candies[i] / mid;
+ if (cnt >= k)
+ l = mid;
+ else
+ r = mid - 1;
+ }
+ return l;
+}
+
+int main() {
+ int c1[] = {5, 8, 6}, c2[] = {2, 5};
+ printf("%d\n", maximumCandies(c1, ARRAY_SIZE(c1), 3)); // expect: 5
+ printf("%d\n", maximumCandies(c2, ARRAY_SIZE(c2), 11)); // expect: 0
+}