+ problem 502

Author: fruit-in

Problemset/0502-IPO/README.md

@@ -0,0 +1,68 @@
+# 502. IPO
+Suppose LeetCode will start its **IPO** soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase its capital before the **IPO**. Since it has limited resources, it can only finish at most `k` distinct projects before the **IPO**. Help LeetCode design the best way to maximize its total capital after finishing at most `k` distinct projects.
+
+You are given `n` projects where the <code>i<sup>th</sup></code> project has a pure profit `profits[i]` and a minimum capital of `capital[i]` is needed to start it.
+
+Initially, you have `w` capital. When you finish a project, you will obtain its pure profit and the profit will be added to your total capital.
+
+Pick a list of **at most** `k` distinct projects from given projects to **maximize your final capital**, and return *the final maximized capital*.
+
+The answer is guaranteed to fit in a 32-bit signed integer.
+
+#### Example 1:
+<pre>
+<strong>Input:</strong> k = 2, w = 0, profits = [1,2,3], capital = [0,1,1]
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> Since your initial capital is 0, you can only start the project indexed 0.
+After finishing it you will obtain profit 1 and your capital becomes 1.
+With capital 1, you can either start the project indexed 1 or the project indexed 2.
+Since you can choose at most 2 projects, you need to finish the project indexed 2 to get the maximum capital.
+Therefore, output the final maximized capital, which is 0 + 1 + 3 = 4.
+</pre>
+
+#### Example 2:
+<pre>
+<strong>Input:</strong> k = 3, w = 0, profits = [1,2,3], capital = [0,1,2]
+<strong>Output:</strong> 6
+</pre>
+
+#### Constraints:
+* <code>1 <= k <= 10<sup>5</sup></code>
+* <code>0 <= w <= 10<sup>9</sup></code>
+* `n == profits.length`
+* `n == capital.length`
+* <code>1 <= n <= 10<sup>5</sup></code>
+* <code>0 <= profits[i] <= 10<sup>4</sup></code>
+* <code>0 <= capital[i] <= 10<sup>9</sup></code>
+
+## Solutions (Rust)
+
+### 1. Solution
+```Rust
+use std::collections::BinaryHeap;
+
+impl Solution {
+    pub fn find_maximized_capital(k: i32, w: i32, profits: Vec<i32>, capital: Vec<i32>) -> i32 {
+        let mut w = w;
+        let mut projects = capital
+            .into_iter()
+            .zip(profits.into_iter())
+            .collect::<Vec<_>>();
+        let mut heap = BinaryHeap::new();
+        let mut i = 0;
+
+        projects.sort_unstable();
+
+        for _ in 0..k {
+            while i < projects.len() && projects[i].0 <= w {
+                heap.push(projects[i].1);
+                i += 1;
+            }
+
+            w += heap.pop().unwrap_or(0);
+        }
+
+        w
+    }
+}
+```

Problemset/0502-IPO/README_CN.md

@@ -0,0 +1,69 @@
+# 502. IPO
+假设 力扣（LeetCode）即将开始 **IPO** 。为了以更高的价格将股票卖给风险投资公司，力扣 希望在 IPO 之前开展一些项目以增加其资本。 由于资源有限，它只能在 IPO 之前完成最多 `k` 个不同的项目。帮助 力扣 设计完成最多 `k` 个不同项目后得到最大总资本的方式。
+
+给你 `n` 个项目。对于每个项目 `i` ，它都有一个纯利润 `profits[i]` ，和启动该项目需要的最小资本 `capital[i]` 。
+
+最初，你的资本为 `w` 。当你完成一个项目时，你将获得纯利润，且利润将被添加到你的总资本中。
+
+总而言之，从给定项目中选择 **最多** `k` 个不同项目的列表，以 **最大化最终资本** ，并输出最终可获得的最多资本。
+
+答案保证在 32 位有符号整数范围内。
+
+#### 示例 1:
+<pre>
+<strong>输入:</strong> k = 2, w = 0, profits = [1,2,3], capital = [0,1,1]
+<strong>输出:</strong> 4
+<strong>解释:</strong>
+由于你的初始资本为 0，你仅可以从 0 号项目开始。
+在完成后，你将获得 1 的利润，你的总资本将变为 1。
+此时你可以选择开始 1 号或 2 号项目。
+由于你最多可以选择两个项目，所以你需要完成 2 号项目以获得最大的资本。
+因此，输出最后最大化的资本，为 0 + 1 + 3 = 4。
+</pre>
+
+#### 示例 2:
+<pre>
+<strong>输入:</strong> k = 3, w = 0, profits = [1,2,3], capital = [0,1,2]
+<strong>输出:</strong> 6
+</pre>
+
+#### 提示:
+* <code>1 <= k <= 10<sup>5</sup></code>
+* <code>0 <= w <= 10<sup>9</sup></code>
+* `n == profits.length`
+* `n == capital.length`
+* <code>1 <= n <= 10<sup>5</sup></code>
+* <code>0 <= profits[i] <= 10<sup>4</sup></code>
+* <code>0 <= capital[i] <= 10<sup>9</sup></code>
+
+## 题解 (Rust)
+
+### 1. 题解
+```Rust
+use std::collections::BinaryHeap;
+
+impl Solution {
+    pub fn find_maximized_capital(k: i32, w: i32, profits: Vec<i32>, capital: Vec<i32>) -> i32 {
+        let mut w = w;
+        let mut projects = capital
+            .into_iter()
+            .zip(profits.into_iter())
+            .collect::<Vec<_>>();
+        let mut heap = BinaryHeap::new();
+        let mut i = 0;
+
+        projects.sort_unstable();
+
+        for _ in 0..k {
+            while i < projects.len() && projects[i].0 <= w {
+                heap.push(projects[i].1);
+                i += 1;
+            }
+
+            w += heap.pop().unwrap_or(0);
+        }
+
+        w
+    }
+}
+```

Problemset/0502-IPO/Solution.rs

@@ -0,0 +1,26 @@
+use std::collections::BinaryHeap;
+
+impl Solution {
+    pub fn find_maximized_capital(k: i32, w: i32, profits: Vec<i32>, capital: Vec<i32>) -> i32 {
+        let mut w = w;
+        let mut projects = capital
+            .into_iter()
+            .zip(profits.into_iter())
+            .collect::<Vec<_>>();
+        let mut heap = BinaryHeap::new();
+        let mut i = 0;
+
+        projects.sort_unstable();
+
+        for _ in 0..k {
+            while i < projects.len() && projects[i].0 <= w {
+                heap.push(projects[i].1);
+                i += 1;
+            }
+
+            w += heap.pop().unwrap_or(0);
+        }
+
+        w
+    }
+}

README.md

@@ -300,6 +300,7 @@
 [498][498l]  |[Diagonal Traverse][498]                                                              |![rs]
 [500][500l]  |[Keyboard Row][500]                                                                   |![py]
 [501][501l]  |[Find Mode in Binary Search Tree][501]                                                |![py]
+[502][502l]  |[IPO][502]                                                                            |![rs]
 [503][503l]  |[Next Greater Element II][503]                                                        |![rs]
 [504][504l]  |[Base 7][504]                                                                         |![py]
 [506][506l]  |[Relative Ranks][506]                                                                 |![rs]
@@ -1633,6 +1634,7 @@
 [498]:Problemset/0498-Diagonal%20Traverse/README.md#498-diagonal-traverse
 [500]:Problemset/0500-Keyboard%20Row/README.md#500-keyboard-row
 [501]:Problemset/0501-Find%20Mode%20in%20Binary%20Search%20Tree/README.md#501-find-mode-in-binary-search-tree
+[502]:Problemset/0502-IPO/README.md#502-ipo
 [503]:Problemset/0503-Next%20Greater%20Element%20II/README.md#503-next-greater-element-ii
 [504]:Problemset/0504-Base%207/README.md#504-base-7
 [506]:Problemset/0506-Relative%20Ranks/README.md#506-relative-ranks
@@ -2966,6 +2968,7 @@
 [498l]:https://leetcode.com/problems/diagonal-traverse/
 [500l]:https://leetcode.com/problems/keyboard-row/
 [501l]:https://leetcode.com/problems/find-mode-in-binary-search-tree/
+[502l]:https://leetcode.com/problems/ipo/
 [503l]:https://leetcode.com/problems/next-greater-element-ii/
 [504l]:https://leetcode.com/problems/base-7/
 [506l]:https://leetcode.com/problems/relative-ranks/

README_CN.md

@@ -300,6 +300,7 @@
 [498][498l]  |[对角线遍历][498]                                         |![rs]
 [500][500l]  |[键盘行][500]                                             |![py]
 [501][501l]  |[二叉搜索树中的众数][501]                                 |![py]
+[502][502l]  |[IPO][502]                                                |![rs]
 [503][503l]  |[下一个更大元素 II][503]                                  |![rs]
 [504][504l]  |[七进制数][504]                                           |![py]
 [506][506l]  |[相对名次][506]                                           |![rs]
@@ -1633,6 +1634,7 @@
 [498]:Problemset/0498-Diagonal%20Traverse/README_CN.md#498-对角线遍历
 [500]:Problemset/0500-Keyboard%20Row/README_CN.md#500-键盘行
 [501]:Problemset/0501-Find%20Mode%20in%20Binary%20Search%20Tree/README_CN.md#501-二叉搜索树中的众数
+[502]:Problemset/0502-IPO/README_CN.md#502-ipo
 [503]:Problemset/0503-Next%20Greater%20Element%20II/README_CN.md#503-下一个更大元素-ii
 [504]:Problemset/0504-Base%207/README_CN.md#504-七进制数
 [506]:Problemset/0506-Relative%20Ranks/README_CN.md#506-相对名次
@@ -2966,6 +2968,7 @@
 [498l]:https://leetcode.cn/problems/diagonal-traverse/
 [500l]:https://leetcode.cn/problems/keyboard-row/
 [501l]:https://leetcode.cn/problems/find-mode-in-binary-search-tree/
+[502l]:https://leetcode.cn/problems/ipo/
 [503l]:https://leetcode.cn/problems/next-greater-element-ii/
 [504l]:https://leetcode.cn/problems/base-7/
 [506l]:https://leetcode.cn/problems/relative-ranks/