Math
1
2
3
4
5
6
7
8
9
10
11
12
13
| class Solution {
public long minimumRemoval(int[] beans) {
Arrays.sort(beans);
long sum = 0, maxArea = 0;
for (int i = 0; i < beans.length; i++) {
sum += beans[i];
maxArea = Math.max(maxArea, (beans.length - i) * (long) beans[i]);
}
return sum - maxArea;
}
}
|
References
2171. Removing Minimum Number of Magic Beans