feat: add weekly contest 478

solution/1300-1399/1354.Construct Target Array With Multiple Sums/README_EN.md

@@ -35,7 +35,7 @@ tags:
 <pre>
 <strong>Input:</strong> target = [9,3,5]
 <strong>Output:</strong> true
-<strong>Explanation:</strong> Start with arr = [1, 1, 1]
+<strong>Explanation:</strong> Start with arr = [1, 1, 1] 
 [1, 1, 1], sum = 3 choose index 1
 [1, 3, 1], sum = 5 choose index 2
 [1, 3, 5], sum = 9 choose index 0

solution/3700-3799/3750.Minimum Number of Flips to Reverse Binary String/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3750.Minimum%20Number%20of%20Flips%20to%20Reverse%20Binary%20String/README.md
+rating: 1288
+source: 第 170 场双周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3700-3799/3750.Minimum Number of Flips to Reverse Binary String/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3750.Minimum%20Number%20of%20Flips%20to%20Reverse%20Binary%20String/README_EN.md
+rating: 1288
+source: Biweekly Contest 170 Q1
 ---
 
 <!-- problem:start -->

solution/3700-3799/3751.Total Waviness of Numbers in Range I/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3751.Total%20Waviness%20of%20Numbers%20in%20Range%20I/README.md
+rating: 1404
+source: 第 170 场双周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3700-3799/3751.Total Waviness of Numbers in Range I/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3751.Total%20Waviness%20of%20Numbers%20in%20Range%20I/README_EN.md
+rating: 1404
+source: Biweekly Contest 170 Q2
 ---
 
 <!-- problem:start -->

solution/3700-3799/3752.Lexicographically Smallest Negated Permutation that Sums to Target/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3752.Lexicographically%20Smallest%20Negated%20Permutation%20that%20Sums%20to%20Target/README.md
+rating: 1827
+source: 第 170 场双周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3700-3799/3752.Lexicographically Smallest Negated Permutation that Sums to Target/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3752.Lexicographically%20Smallest%20Negated%20Permutation%20that%20Sums%20to%20Target/README_EN.md
+rating: 1827
+source: Biweekly Contest 170 Q3
 ---
 
 <!-- problem:start -->

solution/3700-3799/3753.Total Waviness of Numbers in Range II/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3753.Total%20Waviness%20of%20Numbers%20in%20Range%20II/README.md
+rating: 2296
+source: 第 170 场双周赛 Q4
 ---
 
 <!-- problem:start -->

solution/3700-3799/3753.Total Waviness of Numbers in Range II/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3753.Total%20Waviness%20of%20Numbers%20in%20Range%20II/README_EN.md
+rating: 2296
+source: Biweekly Contest 170 Q4
 ---
 
 <!-- problem:start -->

solution/3700-3799/3754.Concatenate Non-Zero Digits and Multiply by Sum I/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3754.Concatenate%20Non-Zero%20Digits%20and%20Multiply%20by%20Sum%20I/README.md
+rating: 1247
+source: 第 477 场周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3700-3799/3754.Concatenate Non-Zero Digits and Multiply by Sum I/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3754.Concatenate%20Non-Zero%20Digits%20and%20Multiply%20by%20Sum%20I/README_EN.md
+rating: 1247
+source: Weekly Contest 477 Q1
 ---
 
 <!-- problem:start -->

solution/3700-3799/3755.Find Maximum Balanced XOR Subarray Length/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3755.Find%20Maximum%20Balanced%20XOR%20Subarray%20Length/README.md
+rating: 1663
+source: 第 477 场周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3700-3799/3755.Find Maximum Balanced XOR Subarray Length/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3755.Find%20Maximum%20Balanced%20XOR%20Subarray%20Length/README_EN.md
+rating: 1663
+source: Weekly Contest 477 Q2
 ---
 
 <!-- problem:start -->

solution/3700-3799/3756.Concatenate Non-Zero Digits and Multiply by Sum II/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3756.Concatenate%20Non-Zero%20Digits%20and%20Multiply%20by%20Sum%20II/README.md
+rating: 1968
+source: 第 477 场周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3700-3799/3756.Concatenate Non-Zero Digits and Multiply by Sum II/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3756.Concatenate%20Non-Zero%20Digits%20and%20Multiply%20by%20Sum%20II/README_EN.md
+rating: 1968
+source: Weekly Contest 477 Q3
 ---
 
 <!-- problem:start -->

solution/3700-3799/3757.Number of Effective Subsequences/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3757.Number%20of%20Effective%20Subsequences/README.md
+rating: 2519
+source: 第 477 场周赛 Q4
 ---
 
 <!-- problem:start -->

solution/3700-3799/3757.Number of Effective Subsequences/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3757.Number%20of%20Effective%20Subsequences/README_EN.md
+rating: 2519
+source: Weekly Contest 477 Q4
 ---
 
 <!-- problem:start -->

solution/3700-3799/3759.Count Elements With at Least K Greater Values/README.md

@@ -0,0 +1,173 @@
+---
+comments: true
+difficulty: 中等
+edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3759.Count%20Elements%20With%20at%20Least%20K%20Greater%20Values/README.md
+---
+
+<!-- problem:start -->
+
+# [3759. 统计合格元素的数目](https://leetcode.cn/problems/count-elements-with-at-least-k-greater-values)
+
+[English Version](/solution/3700-3799/3759.Count%20Elements%20With%20at%20Least%20K%20Greater%20Values/README_EN.md)
+
+## 题目描述
+
+<!-- description:start -->
+
+<p>给你一个长度为 <code>n</code> 的整数数组 <code>nums</code> 和一个整数 <code>k</code>。</p>
+
+<p>如果数组 <code>nums</code> 中的某个元素满足以下条件，则称其为 <strong>合格元素</strong>：存在&nbsp;<strong>至少</strong> <code>k</code> 个元素&nbsp;<strong>严格大于&nbsp;</strong>它。</p>
+
+<p>返回一个整数，表示数组 <code>nums</code> 中合格元素的总数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">nums = [3,1,2], k = 1</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">2</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p>元素 1 和 2 均有至少 <code>k = 1</code> 个元素大于它们。<br />
+没有元素比 3 更大。因此答案是 2。</p>
+</div>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">nums = [5,5,5], k = 2</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">0</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p>由于所有元素都等于 5，没有任何元素比其他元素大。因此答案是 0。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n == nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+	<li><code>0 &lt;= k &lt; n</code></li>
+</ul>
+
+<!-- description:end -->
+
+## 解法
+
+<!-- solution:start -->
+
+### 方法一：排序
+
+如果 $k = 0$，那么数组中所有元素均为合格元素，直接返回数组长度即可。
+
+否则，我们对数组进行排序，记排序后数组长度为 $n$。对于每个下标 $i$ 满足 $0 \\leq i < n - k$ 的元素，如果它严格小于下标为 $n - k$ 的元素，则它是一个合格元素。我们只需统计这样的元素个数并返回即可。
+
+时间复杂度 $O(n \times \log n)$，空间复杂度 $O(\log n)$。其中 $n$ 是数组 $\textit{nums}$ 的长度。
+
+<!-- tabs:start -->
+
+#### Python3
+
+```python
+class Solution:
+    def countElements(self, nums: List[int], k: int) -> int:
+        n = len(nums)
+        if k == 0:
+            return n
+        nums.sort()
+        return sum(nums[n - k] > nums[i] for i in range(n - k))
+```
+
+#### Java
+
+```java
+class Solution {
+    public int countElements(int[] nums, int k) {
+        int n = nums.length;
+        if (k == 0) {
+            return n;
+        }
+        Arrays.sort(nums);
+        int ans = 0;
+        for (int i = 0; i < n - k; ++i) {
+            if (nums[n - k] > nums[i]) {
+                ++ans;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+#### C++
+
+```cpp
+class Solution {
+public:
+    int countElements(vector<int>& nums, int k) {
+        int n = nums.size();
+        if (k == 0) {
+            return n;
+        }
+        ranges::sort(nums);
+        int ans = 0;
+        for (int i = 0; i < n - k; ++i) {
+            if (nums[n - k] > nums[i]) {
+                ++ans;
+            }
+        }
+        return ans;
+    }
+};
+```
+
+#### Go
+
+```go
+func countElements(nums []int, k int) int {
+	n := len(nums)
+	if k == 0 {
+		return n
+	}
+	sort.Ints(nums)
+	ans := 0
+	for i := 0; i < n-k; i++ {
+		if nums[n-k] > nums[i] {
+			ans++
+		}
+	}
+	return ans
+}
+```
+
+#### TypeScript
+
+```ts
+function countElements(nums: number[], k: number): number {
+    const n = nums.length;
+    if (k === 0) {
+        return n;
+    }
+    nums.sort((a, b) => a - b);
+    let ans = 0;
+    for (let i = 0; i < n - k; ++i) {
+        if (nums[n - k] > nums[i]) {
+            ++ans;
+        }
+    }
+    return ans;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- problem:end -->