3683. Earliest Time to Finish One Task

You are given a 2D integer array tasks where tasks[i] = [si, ti].

Each [si, ti] in tasks represents a task with start time si that takes ti units of time to finish.

Return the earliest time at which at least one task is finished.

class Solution {
public:
    int earliestTime(vector<vector<int>>& tasks) {
        int res = INT_MAX;
        for(auto& t : tasks) res = min(res, t[0] + t[1]);
        return res;
    }
};