feat: add biweekly contest 125 (#2404)

Co-authored-by: Doocs Bot <doocs-bot@outlook.com>

Author: yanglbme

solution/3000-3099/3065.Minimum Operations to Exceed Threshold Value I/README.md

@@ -0,0 +1,81 @@
+# [3065. 超过阈值的最少操作数 I](https://leetcode.cn/problems/minimum-operations-to-exceed-threshold-value-i)
+
+[English Version](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README_EN.md)
+
+<!-- tags: -->
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个下标从 <b>0</b>&nbsp;开始的整数数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>k</code>&nbsp;。</p>
+
+<p>一次操作中，你可以删除 <code>nums</code>&nbsp;中的最小元素。</p>
+
+<p>你需要使数组中的所有元素都大于或等于 <code>k</code>&nbsp;，请你返回需要的 <strong>最少</strong>&nbsp;操作次数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<b>输入：</b>nums = [2,11,10,1,3], k = 10
+<b>输出：</b>3
+<b>解释：</b>第一次操作后，nums 变为 [2, 11, 10, 3] 。
+第二次操作后，nums 变为 [11, 10, 3] 。
+第三次操作后，nums 变为 [11, 10] 。
+此时，数组中的所有元素都大于等于 10 ，所以我们停止操作。
+使数组中所有元素都大于等于 10 需要的最少操作次数为 3 。
+</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<b>输入：</b>nums = [1,1,2,4,9], k = 1
+<b>输出：</b>0
+<b>解释：</b>数组中的所有元素都大于等于 1 ，所以不需要对 nums 做任何操作。</pre>
+
+<p><strong class="example">示例 3：</strong></p>
+
+<pre>
+<b>输入：</b>nums = [1,1,2,4,9], k = 9
+<b>输出：</b>4
+<b>解释：</b>nums 中只有一个元素大于等于 9 ，所以需要执行 4 次操作。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 50</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= k &lt;= 10<sup>9</sup></code></li>
+	<li>输入保证至少有一个满足&nbsp;<code>nums[i] &gt;= k</code>&nbsp;的下标&nbsp;<code>i</code>&nbsp;存在。</li>
+</ul>
+
+## 解法
+
+### 方法一
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->

solution/3000-3099/3065.Minimum Operations to Exceed Threshold Value I/README_EN.md

@@ -0,0 +1,77 @@
+# [3065. Minimum Operations to Exceed Threshold Value I](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i)
+
+[中文文档](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README.md)
+
+<!-- tags: -->
+
+## Description
+
+<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>, and an integer <code>k</code>.</p>
+
+<p>In one operation, you can remove one occurrence of the smallest element of <code>nums</code>.</p>
+
+<p>Return <em>the <strong>minimum</strong> number of operations needed so that all elements of the array are greater than or equal to</em> <code>k</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [2,11,10,1,3], k = 10
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> After one operation, nums becomes equal to [2, 11, 10, 3].
+After two operations, nums becomes equal to [11, 10, 3].
+After three operations, nums becomes equal to [11, 10].
+At this stage, all the elements of nums are greater than or equal to 10 so we can stop.
+It can be shown that 3 is the minimum number of operations needed so that all elements of the array are greater than or equal to 10.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,2,4,9], k = 1
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> All elements of the array are greater than or equal to 1 so we do not need to apply any operations on nums.</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,2,4,9], k = 9
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> only a single element of nums is greater than or equal to 9 so we need to apply the operations 4 times on nums.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 50</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= k &lt;= 10<sup>9</sup></code></li>
+	<li>The input is generated such that there is at least one index <code>i</code> such that <code>nums[i] &gt;= k</code>.</li>
+</ul>
+
+## Solutions
+
+### Solution 1
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->

solution/3000-3099/3066.Minimum Operations to Exceed Threshold Value II/README.md

@@ -0,0 +1,85 @@
+# [3066. 超过阈值的最少操作数 II](https://leetcode.cn/problems/minimum-operations-to-exceed-threshold-value-ii)
+
+[English Version](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README_EN.md)
+
+<!-- tags: -->
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个下标从 <strong>0</strong>&nbsp;开始的整数数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>k</code>&nbsp;。</p>
+
+<p>一次操作中，你将执行：</p>
+
+<ul>
+	<li>选择 <code>nums</code>&nbsp;中最小的两个整数&nbsp;<code>x</code> 和&nbsp;<code>y</code>&nbsp;。</li>
+	<li>将&nbsp;<code>x</code> 和&nbsp;<code>y</code> 从&nbsp;<code>nums</code>&nbsp;中删除。</li>
+	<li>将&nbsp;<code>min(x, y) * 2 + max(x, y)</code>&nbsp;添加到数组中的任意位置。</li>
+</ul>
+
+<p><b>注意，</b>只有当&nbsp;<code>nums</code>&nbsp;至少包含两个元素时，你才可以执行以上操作。</p>
+
+<p>你需要使数组中的所有元素都大于或等于&nbsp;<code>k</code>&nbsp;，请你返回需要的&nbsp;<strong>最少</strong>&nbsp;操作次数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<b>输入：</b>nums = [2,11,10,1,3], k = 10
+<b>输出：</b>2
+<b>解释：</b>第一次操作中，我们删除元素 1 和 2 ，然后添加 1 * 2 + 2 到 nums 中，nums 变为 [4, 11, 10, 3] 。
+第二次操作中，我们删除元素 3 和 4 ，然后添加 3 * 2 + 4 到 nums 中，nums 变为 [10, 11, 10] 。
+此时，数组中的所有元素都大于等于 10 ，所以我们停止操作。
+使数组中所有元素都大于等于 10 需要的最少操作次数为 2 。
+</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<b>输入：</b>nums = [1,1,2,4,9], k = 20
+<b>输出：</b>4
+<b>解释：</b>第一次操作后，nums 变为 [2, 4, 9, 3] 。
+第二次操作后，nums 变为 [7, 4, 9] 。
+第三次操作后，nums 变为 [15, 9] 。
+第四次操作后，nums 变为 [33] 。
+此时，数组中的所有元素都大于等于 20 ，所以我们停止操作。
+使数组中所有元素都大于等于 20 需要的最少操作次数为 4 。</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>2 &lt;= nums.length &lt;= 2 * 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= k &lt;= 10<sup>9</sup></code></li>
+	<li>输入保证答案一定存在，也就是说一定存在一个操作序列使数组中所有元素都大于等于&nbsp;<code>k</code> 。</li>
+</ul>
+
+## 解法
+
+### 方法一
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->

solution/3000-3099/3066.Minimum Operations to Exceed Threshold Value II/README_EN.md

@@ -0,0 +1,81 @@
+# [3066. Minimum Operations to Exceed Threshold Value II](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-ii)
+
+[中文文档](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README.md)
+
+<!-- tags: -->
+
+## Description
+
+<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>, and an integer <code>k</code>.</p>
+
+<p>In one operation, you will:</p>
+
+<ul>
+	<li>Take the two smallest integers <code>x</code> and <code>y</code> in <code>nums</code>.</li>
+	<li>Remove <code>x</code> and <code>y</code> from <code>nums</code>.</li>
+	<li>Add <code>min(x, y) * 2 + max(x, y)</code> anywhere in the array.</li>
+</ul>
+
+<p><strong>Note</strong> that you can only apply the described operation if <code>nums</code> contains at least two elements.</p>
+
+<p>Return <em>the <strong>minimum</strong> number of operations needed so that all elements of the array are greater than or equal to</em> <code>k</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [2,11,10,1,3], k = 10
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> In the first operation, we remove elements 1 and 2, then add 1 * 2 + 2 to nums. nums becomes equal to [4, 11, 10, 3].
+In the second operation, we remove elements 3 and 4, then add 3 * 2 + 4 to nums. nums becomes equal to [10, 11, 10].
+At this stage, all the elements of nums are greater than or equal to 10 so we can stop.
+It can be shown that 2 is the minimum number of operations needed so that all elements of the array are greater than or equal to 10.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,2,4,9], k = 20
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> After one operation, nums becomes equal to [2, 4, 9, 3].
+After two operations, nums becomes equal to [7, 4, 9].
+After three operations, nums becomes equal to [15, 9].
+After four operations, nums becomes equal to [33].
+At this stage, all the elements of nums are greater than 20 so we can stop.
+It can be shown that 4 is the minimum number of operations needed so that all elements of the array are greater than or equal to 20.</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= nums.length &lt;= 2 * 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= k &lt;= 10<sup>9</sup></code></li>
+	<li>The input is generated such that an answer always exists. That is, there exists some sequence of operations after which all elements of the array are greater than or equal to <code>k</code>.</li>
+</ul>
+
+## Solutions
+
+### Solution 1
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->