mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
45 lines
1.9 KiB
HTML
45 lines
1.9 KiB
HTML
|
<p>You are given a <strong>0-indexed</strong> integer array <code>piles</code>, where <code>piles[i]</code> represents the number of stones in the <code>i<sup>th</sup></code> pile, and an integer <code>k</code>. You should apply the following operation <strong>exactly</strong> <code>k</code> times:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>Choose any <code>piles[i]</code> and <strong>remove</strong> <code>floor(piles[i] / 2)</code> stones from it.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p><strong>Notice</strong> that you can apply the operation on the <strong>same</strong> pile more than once.</p>
|
||
|
|
|
||
|
|
<p>Return <em>the <strong>minimum</strong> possible total number of stones remaining after applying the </em><code>k</code><em> operations</em>.</p>
|
||
|
|
|
||
|
|
<p><code>floor(x)</code> is the <b>greatest</b> integer that is <strong>smaller</strong> than or <strong>equal</strong> to <code>x</code> (i.e., rounds <code>x</code> down).</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> piles = [5,4,9], k = 2
|
||
|
|
<strong>Output:</strong> 12
|
||
|
|
<strong>Explanation:</strong> Steps of a possible scenario are:
|
||
|
|
- Apply the operation on pile 2. The resulting piles are [5,4,<u>5</u>].
|
||
|
|
- Apply the operation on pile 0. The resulting piles are [<u>3</u>,4,5].
|
||
|
|
The total number of stones in [3,4,5] is 12.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> piles = [4,3,6,7], k = 3
|
||
|
|
<strong>Output:</strong> 12
|
||
|
|
<strong>Explanation:</strong> Steps of a possible scenario are:
|
||
|
|
- Apply the operation on pile 2. The resulting piles are [4,3,<u>3</u>,7].
|
||
|
|
- Apply the operation on pile 3. The resulting piles are [4,3,3,<u>4</u>].
|
||
|
|
- Apply the operation on pile 0. The resulting piles are [<u>2</u>,3,3,4].
|
||
|
|
The total number of stones in [2,3,3,4] is 12.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= piles.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>1 <= piles[i] <= 10<sup>4</sup></code></li>
|
||
|
|
<li><code>1 <= k <= 10<sup>5</sup></code></li>
|
||
|
|
</ul>
|