maximum-candies-allocated-to-k-children

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a 0-indexed integer array <code>candies</code>. Each element in the array denotes a pile of candies of size <code>candies[i]</code>. You can divide each pile into any number of sub piles, but you cannot merge two piles together.

You are also given an integer <code>k</code>. You should allocate piles of candies to <code>k</code> 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.

&nbsp;
Example 1:

<pre>
Input: candies = [5,8,6], k = 3
Output: 5
Explanation: We can divide candies[1] into 2 piles of size 5 and 3, and candies[2] into 2 piles of size 5 and 1. We now have five piles of candies of sizes 5, 5, 3, 5, and 1. We can allocate the 3 piles of size 5 to 3 children. It can be proven that each child cannot receive more than 5 candies.
</pre>

Example 2:

<pre>
Input: candies = [2,5], k = 11
Output: 0
Explanation: There are 11 children but only 7 candies in total, so it is impossible to ensure each child receives at least one candy. Thus, each child gets no candy and the answer is 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= candies.length &lt;= 105</code></li>
	<li><code>1 &lt;= candies[i] &lt;= 107</code></li>
	<li><code>1 &lt;= k &lt;= 1012</code></li>
</ul>

maximumCandies

Maximum Candies Allocated to K Children

Koko Eating Bananas

koko-eating-bananas

爱吃香蕉的珂珂

Minimum Limit of Balls in a Bag

minimum-limit-of-balls-in-a-bag

袋子里最少数目的球

Minimum Speed to Arrive on Time

minimum-speed-to-arrive-on-time

准时到达的列车最小时速

Maximum Number of Removable Characters

maximum-number-of-removable-characters

可移除字符的最大数目

Minimized Maximum of Products Distributed to Any Store

minimized-maximum-of-products-distributed-to-any-store

分配给商店的最多商品的最小值

Minimum Time to Complete Trips

minimum-time-to-complete-trips

完成旅途的最少时间

Minimize Maximum of Array

minimize-maximum-of-array

最小化数组中的最大值

Maximize Happiness of Selected Children

maximize-happiness-of-selected-children

幸福值最大化的选择方案

Array

Binary Search

给你一个 下标从 0 开始 的整数数组 <code>candies</code> 。数组中的每个元素表示大小为 <code>candies[i]</code> 的一堆糖果。你可以将每堆糖果分成任意数量的 子堆 ，但 无法 再将两堆合并到一起。

另给你一个整数 <code>k</code> 。你需要将这些糖果分配给 <code>k</code> 个小孩，使每个小孩分到 相同 数量的糖果。每个小孩可以拿走 至多一堆 糖果，有些糖果可能会不被分配。

返回每个小孩可以拿走的 最大糖果数目 。

&nbsp;

示例 1：

<pre>
输入：candies = [5,8,6], k = 3
输出：5
解释：可以将 candies[1] 分成大小分别为 5 和 3 的两堆，然后把 candies[2] 分成大小分别为 5 和 1 的两堆。现在就有五堆大小分别为 5、5、3、5 和 1 的糖果。可以把 3 堆大小为 5 的糖果分给 3 个小孩。可以证明无法让每个小孩得到超过 5 颗糖果。
</pre>

示例 2：

<pre>
输入：candies = [2,5], k = 11
输出：0
解释：总共有 11 个小孩，但只有 7 颗糖果，但如果要分配糖果的话，必须保证每个小孩至少能得到 1 颗糖果。因此，最后每个小孩都没有得到糖果，答案是 0 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= candies.length &lt;= 105</code></li>
	<li><code>1 &lt;= candies[i] &lt;= 107</code></li>
	<li><code>1 &lt;= k &lt;= 1012</code></li>
</ul>