1
class Solution {
2
public:
3
int maxSatisfaction(vector<int> &satisfaction) {
4
sort(satisfaction.begin(), satisfaction.end(), greater<int>());
5
if (satisfaction[0] <= 0) return 0;
6
int ans = 0;
7
int total = 0;
8
for (int i = 0; i < satisfaction.size(); i++) {
9
if (total + ans + satisfaction[i] > total) {
10
ans = ans + satisfaction[i];
11
total = total + ans;
12
continue;
13
}
14
return total;
15
}
16
return total;
17
}
18
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0