maximize-sum-after-at-most-k-digit-rearrangements

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> of length <code>n</code> and an integer <code>k</code>.

In one operation, you may choose any element of <code>nums</code> and rearrange its decimal digits in any order to form a new integer.

Return the maximum possible sum of the array after performing at most <code>k</code> operations.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [123,45], k = 1

Output: 366

Explanation:

<ul>
	<li>We choose <code>nums[0] = 123</code> and rearrange its digits to form 321.</li>
	<li>The array becomes <code>[321, 45]</code>. Thus, the total sum is <code>321 + 45 = 366</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: nums = [102,90,14], k = 2

Output: 341

Explanation:

<ul>
	<li>We choose <code>nums[0] = 102</code> and rearrange its digits to form 210.</li>
	<li>We choose <code>nums[2] = 14</code> and rearrange its digits to form 41.</li>
	<li>The array becomes <code>[210, 90, 41]</code>. Thus, the total sum is <code>210 + 90 + 41 = 341</code>.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n == nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>1 &lt;= k &lt;= n</code></li>
</ul>

Weekly Contest 525

weekly-contest-525

maximizeSum

Maximize Sum After At Most K Digit Rearrangements

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given an integer array nums of length n and an integer k.

In one operation, you may choose any element of nums and rearrange its decimal digits in any order to form a new integer.

Return the maximum possible sum of the array after performing at most k operations.

 

Example 1:

Input: nums = [123,45], k = 1

Output: 366

Explanation:

 * We choose nums[0] = 123 and rearrange its digits to form 321.
 * The array becomes [321, 45]. Thus, the total sum is 321 + 45 = 366.

Example 2:

Input: nums = [102,90,14], k = 2

Output: 341

Explanation:

 * We choose nums[0] = 102 and rearrange its digits to form 210.
 * We choose nums[2] = 14 and rearrange its digits to form 41.
 * The array becomes [210, 90, 41]. Thus, the total sum is 210 + 90 + 41 = 341.

 

Constraints:

 * 1 <= n == nums.length <= 105
 * 1 <= nums[i] <= 109
 * 1 <= k <= n