leetcode

0 class Solution {

1 public:

2 long long maxSpending(const vector<vector<int>> &values) const {

3 const int n = size(values), m = size(values[0]);

4 long long res = 0, add = 0;

5 static int vec[100001];

6

7 for (int i = 0; i < n; i++) {

8 for (int j = 0; j < m; j++) {

9 vec[m * i + j] = values[i][j];

10 }

11 }

12

13 sort(vec, vec + n * m, greater());

14 for (int i = 0; i < n * m; i++) {

15 res += add += vec[i];

16 }

17

18 return res;

19 }

20 };