Oct 4, 2020 · Oct 3, 2020 · Oct 3, 2020 · Oct 3, 2020
diff --git a/README.md b/README.md
 |1409|[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1409.java) | |Medium|Array|
 |1408|[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1408.java) | |Easy|String|
 |1403|[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1403.java) | |Easy|Greedy, Sort|
 |1402|[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/)|[Solution](../master/cpp/_1402.cpp) | |Hard|Dynamic Programming|
 |1401|[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1401.java) | |Medium|Geometry|
 |1400|[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1400.java) | |Medium|Greedy|
 |1399|[Count Largest Group](https://leetcode.com/problems/count-largest-group/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1399.java) | |Easy|Array|
diff --git a/cpp/_1402.cpp b/cpp/_1402.cpp
 class Solution {
 public:
    int maxSatisfaction(vector<int>& sat) {
        // we'll greedily only consider a suffix of the sorted array
        sort(sat.begin(), sat.end());
        int cmax = 0;
        int sum = 0;
        int csum = 0;
        int i = sat.size(); // iterate from n - 1 to 0
        while(i--) {
            // calulate current satisfaction
            csum += sat[i];
            sum += csum;
            // compare with cmax
            cmax = max(cmax, sum);
        }
        return cmax;
    }
 };
Original file line number	Diff line number	Diff line change
Expand Up		@@ -86,6 +86,7 @@ _If you like this project, please leave me a star._ ★
		\|1409\|[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1409.java) \| \|Medium\|Array\|
		\|1408\|[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1408.java) \| \|Easy\|String\|
		\|1403\|[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1403.java) \| \|Easy\|Greedy, Sort\|
		\|1402\|[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/)\|[Solution](../master/cpp/_1402.cpp) \| \|Hard\|Dynamic Programming\|
		\|1401\|[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1401.java) \| \|Medium\|Geometry\|
		\|1400\|[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1400.java) \| \|Medium\|Greedy\|
		\|1399\|[Count Largest Group](https://leetcode.com/problems/count-largest-group/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1399.java) \| \|Easy\|Array\|
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,19 @@
		class Solution {
		public:
		int maxSatisfaction(vector<int>& sat) {
		// we'll greedily only consider a suffix of the sorted array
		sort(sat.begin(), sat.end());
		int cmax = 0;
		int sum = 0;
		int csum = 0;
		int i = sat.size(); // iterate from n - 1 to 0
		while(i--) {
		// calulate current satisfaction
		csum += sat[i];
		sum += csum;
		// compare with cmax
		cmax = max(cmax, sum);
		}
		return cmax;
		}
		};