Minimum Initial Energy to Finish Tasks LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minimumEffort(vector<vector<int>> &tasks) {
4
    int diff = INT_MAX, ans = 0;
5
    for (auto i : tasks) {
6
      diff = min(diff, i[1] - i[0]);
7
      ans += i[0];
8
    }
9
    int val = 0;
10
    for (auto i : tasks) val = max(val, i[1]);
11
    return max(ans + diff, val);
12
  }
13
};