1665. Minimum Initial Energy to Finish Tasks.txt

https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks/

class Solution {
public:
    int minimumEffort(vector<vector<int>>& tasks) {
        sort(tasks.begin(), tasks.end(), [](vector<int>& a, vector<int>& b) {return a[1] - a[0] < b[1] - b[0];});
        int ans = 0;
        for (auto& t : tasks)
            ans = max(ans + t[0], t[1]);
        return ans;
    }
};