1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
| class Solution {
public int maxSatisfaction(int[] satisfaction) {
Arrays.sort(satisfaction);
int maxSatisfaction = 0;
int suffixSum = 0;
for (int i = satisfaction.length - 1; i >= 0; i--) {
suffixSum += satisfaction[i];
if (suffixSum <= 0) {
break;
}
maxSatisfaction += suffixSum;
}
return maxSatisfaction;
}
}
|