update: 添加问题“3075.幸福值最大化的选择方案”的代码和题解+ newSolution.title.extra test (#1280)

* archive: Time!!!

* word: en

* 3075: WA.cpp (#1279)

* 3075: AC.cpp+py + CE.go (#1279)

cpp - AC,86.52%,92.70%
cpp - AC,Cut,86.52%,96.07%
py - AC,39.26%,97.55%

* 3075: AC.go+rust + CE.java (#1279)

go - AC,38.46%,30.77%
rust - AC,33.33%,55.56%
java - 光想着long好像可以直接+int了

* 3075: CE.java (#1279)

哦哦 刚刚是RE

* 3075: AC.java (#1279)

java - AC,60.64%,40.43%

* update: 添加问题“3075.幸福值最大化的选择方案”的代码和题解+ newSolution.title.extra test (#1280)

Signed-off-by: LetMeFly666 <[email protected]>

* article: 新文框架

* 1

* update: 添加问题“3075.幸福值最大化的选择方案”的代码和题解+ newSolution.title.extra test  (删了又回) 换行测试 (#1281)

Signed-off-by: LetMeFly666 <[email protected]>

* update: 添加问题“3075.幸福值最大化的选择方案”的代码和题解+ newSolution.title.extra test  (删了又回) 换行测试 (#1284)

Signed-off-by: LetMeFly666 <[email protected]>

* docs: rm duplicated readme

* fix: error address

---------

Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

.commitTitleExtra

@@ -0,0 +1,3 @@
+ + newSolution.title.extra test 
+(删了又回)
+换行测试

.commitmsg

@@ -4,6 +4,7 @@
         "*.wxss": "css",
         "*.wxml": "html",
         ".commitmsg": "git-commit",
+        ".commitTitleExtra": "git-commit",
         "array": "cpp",
         "atomic": "cpp",
         "*.tcc": "cpp",

.vscode/settings.json

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-25 12:56:03
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-25 12:59:03
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+class Solution {
+public:
+    ll maximumHappinessSum(vector<int>& happiness, int k) {
+        sort(happiness.begin(), happiness.end(), greater<>());
+        ll ans = 0;
+        for (int i = 0; i < k; i++) {
+            ans += max(0, happiness[i] - i);
+        }
+        return ans;
+    }
+};

Codes/3075-maximize-happiness-of-selected-children.cpp

@@ -0,0 +1,21 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-25 12:56:03
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-25 13:08:10
+ */
+package main
+
+import "sort"
+
+func maximumHappinessSum(happiness []int, k int) (ans int64) {
+    sort.Slice(happiness, func(i, j int) bool { return happiness[i] > happiness[j] })
+    for i := 0; i < k; i++ {
+        happiness[i] -= i
+        if happiness[i] <= 0 {
+            return
+        }
+        ans += int64(happiness[i])
+    }
+    return
+}

Codes/3075-maximize-happiness-of-selected-children.go

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-25 12:56:03
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-25 13:18:34
+ */
+import java.util.Arrays;
+
+class Solution {
+    public long maximumHappinessSum(int[] happiness, int k) {
+        Arrays.sort(happiness);
+        long ans = 0;
+        int n = happiness.length;
+        for (int i = 0; i < k; i++) {
+            if (happiness[n - i - 1] <= i) {
+                return ans;
+            }
+            ans += happiness[n - i - 1] - i;
+        }
+        return ans;
+    }
+}

Codes/3075-maximize-happiness-of-selected-children.java

@@ -0,0 +1,11 @@
+'''
+Author: LetMeFly
+Date: 2025-12-25 12:56:03
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-12-25 13:02:05
+'''
+from typing import List
+
+class Solution:
+    def maximumHappinessSum(self, happiness: List[int], k: int) -> int:
+        return sum(max(0, h - i) for i, h in enumerate(sorted(happiness, reverse=True)[:k]))

Codes/3075-maximize-happiness-of-selected-children.py

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-25 12:56:03
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-25 13:12:12
+ */
+impl Solution {
+    pub fn maximum_happiness_sum(mut happiness: Vec<i32>, k: i32) -> i64 {
+        let mut ans: i64 = 0;
+        happiness.sort_by(|a: &i32, b: &i32| b.cmp(a));
+        for i in 0..k {
+            if happiness[i as usize] <= i {
+                return ans;
+            }
+            ans += (happiness[i as usize] - i) as i64;
+        }
+        ans
+    }
+}

Codes/3075-maximize-happiness-of-selected-children.rs

@@ -0,0 +1,26 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-25 12:59:03
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-25 13:00:12
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+class Solution {
+public:
+    ll maximumHappinessSum(vector<int>& happiness, int k) {
+        sort(happiness.begin(), happiness.end(), greater<>());
+        ll ans = 0;
+        for (int i = 0; i < k; i++) {
+            happiness[i] -= i;
+            if (happiness[i] <= 0) {
+                return ans;
+            }
+            ans += happiness[i];
+        }
+        return ans;
+    }
+};

Codes/3075-maximize-happiness-of-selected-children_Cut.cpp

@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-11-01 22:18:35
  */
 pub struct Solution;
-include!("3074-apple-redistribution-into-boxes.rs");  // 这个fileName是会被脚本替换掉的
+include!("3075-maximize-happiness-of-selected-children.rs");  // 这个fileName是会被脚本替换掉的