mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-12-20 02:44:59 +08:00
67 lines
2.8 KiB
HTML
67 lines
2.8 KiB
HTML
<p>You are given two integer arrays, <code>technique1</code> and <code>technique2</code>, each of length <code>n</code>, where <code>n</code> represents the number of tasks to complete.</p>
|
||
|
||
<ul>
|
||
<li>If the <code>i<sup>th</sup></code> task is completed using technique 1, you earn <code>technique1[i]</code> points.</li>
|
||
<li>If it is completed using technique 2, you earn <code>technique2[i]</code> points.</li>
|
||
</ul>
|
||
|
||
<p>You are also given an integer <code>k</code>, representing the <strong>minimum</strong> number of tasks that <strong>must</strong> be completed using technique 1.</p>
|
||
|
||
<p>You <strong>must</strong> complete <strong>at least</strong> <code>k</code> tasks using technique 1 (they do not need to be the first <code>k</code> tasks).</p>
|
||
|
||
<p>The remaining tasks may be completed using <strong>either</strong> technique.</p>
|
||
|
||
<p>Return an integer denoting the <strong>maximum total points</strong> you can earn.</p>
|
||
|
||
<p> </p>
|
||
<p><strong class="example">Example 1:</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>Input:</strong> <span class="example-io">technique1 = [5,2,10], technique2 = [10,3,8], k = 2</span></p>
|
||
|
||
<p><strong>Output:</strong> <span class="example-io">22</span></p>
|
||
|
||
<p><strong>Explanation:</strong></p>
|
||
|
||
<p>We must complete at least <code>k = 2</code> tasks using <code>technique1</code>.</p>
|
||
|
||
<p>Choosing <code>technique1[1]</code> and <code>technique1[2]</code> (completed using technique 1), and <code>technique2[0]</code> (completed using technique 2), yields the maximum points: <code>2 + 10 + 10 = 22</code>.</p>
|
||
</div>
|
||
|
||
<p><strong class="example">Example 2:</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>Input:</strong> <span class="example-io">technique1 = [10,20,30], technique2 = [5,15,25], k = 2</span></p>
|
||
|
||
<p><strong>Output:</strong> <span class="example-io">60</span></p>
|
||
|
||
<p><strong>Explanation:</strong></p>
|
||
|
||
<p>We must complete at least <code>k = 2</code> tasks using <code>technique1</code>.</p>
|
||
|
||
<p>Choosing all tasks using technique 1 yields the maximum points: <code>10 + 20 + 30 = 60</code>.</p>
|
||
</div>
|
||
|
||
<p><strong class="example">Example 3:</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>Input:</strong> <span class="example-io">technique1 = [1,2,3], technique2 = [4,5,6], k = 0</span></p>
|
||
|
||
<p><strong>Output:</strong> <span class="example-io">15</span></p>
|
||
|
||
<p><strong>Explanation:</strong></p>
|
||
|
||
<p>Since <code>k = 0</code>, we are not required to choose any task using <code>technique1</code>.</p>
|
||
|
||
<p>Choosing all tasks using technique 2 yields the maximum points: <code>4 + 5 + 6 = 15</code>.</p>
|
||
</div>
|
||
|
||
<p> </p>
|
||
<p><strong>Constraints:</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= n == technique1.length == technique2.length <= 10<sup>5</sup></code></li>
|
||
<li><code>1 <= technique1[i], technique2[i] <= 10<sup>5</sup></code></li>
|
||
<li><code>0 <= k <= n</code></li>
|
||
</ul>
|