-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram25.java
More file actions
64 lines (48 loc) · 2.11 KB
/
program25.java
File metadata and controls
64 lines (48 loc) · 2.11 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/*
2656. Maximum Sum With Exactly K Elements
Easy
98
6
Companies
You are given a 0-indexed integer array nums and an integer k. Your task is to perform the following operation exactly k times in order to maximize your score:
Select an element m from nums.
Remove the selected element m from the array.
Add a new element with a value of m + 1 to the array.
Increase your score by m.
Return the maximum score you can achieve after performing the operation exactly k times.
Example 1:
Input: nums = [1,2,3,4,5], k = 3
Output: 18
Explanation: We need to choose exactly 3 elements from nums to maximize the sum.
For the first iteration, we choose 5. Then sum is 5 and nums = [1,2,3,4,6]
For the second iteration, we choose 6. Then sum is 5 + 6 and nums = [1,2,3,4,7]
For the third iteration, we choose 7. Then sum is 5 + 6 + 7 = 18 and nums = [1,2,3,4,8]
So, we will return 18.
It can be proven, that 18 is the maximum answer that we can achieve.
Example 2:
Input: nums = [5,5,5], k = 2
Output: 11
Explanation: We need to choose exactly 2 elements from nums to maximize the sum.
For the first iteration, we choose 5. Then sum is 5 and nums = [5,5,6]
For the second iteration, we choose 6. Then sum is 5 + 6 = 11 and nums = [5,5,7]
So, we will return 11.
It can be proven, that 11 is the maximum answer that we can achieve.
*/
package LeetCode;
import java.util.Arrays;
public class program25 {
static int maximizeSum(int[] nums, int k) {
int sum=0;
Arrays.sort(nums);
for(int i=0;i<k;i++){
sum +=nums[nums.length-1];
nums[nums.length-1] = (nums[nums.length-1]+1);
}
return sum;
}
public static void main(String[] args) {
int[] nums = {5,5,5};
int k=2;
System.out.println(maximizeSum(nums, k));
}
}