Check mobile phone prices qatar for more information.

int taskScheduling(int d, int m) { // Read d task descriptions vector> tasks; for (int i = 0; i < d; i++) { int duration, deadline; cin >> duration >> deadline; tasks.push_back({duration, deadline}); }

// Sort tasks by deadline (Earliest Deadline First)
sort(tasks.begin(), tasks.end(), [](const pair<int, int>& a, const pair<int, int>& b) {
    return a.second < b.second;
});

int currentTime = 0;
int maxLateness = 0;

// Schedule each task and compute maximum lateness
for (auto& task : tasks) {
    int duration = task.first;
    int deadline = task.second;
    currentTime += duration;
    int lateness = max(0, currentTime - deadline);
    maxLateness = max(maxLateness, lateness);
}

return maxLateness;

}