Just leaving this here: 🧪 Try 1: Schedule in input order

Tasks in order: (3, 4), (2, 5), (1, 3)

Time goes like this: - Task 1: takes 3 minutes → finishes at time = 3 → deadline = 4 → lateness = 0 - Task 2: takes 2 minutes → finishes at time = 3 + 2 = 5 → deadline = 5 → lateness = 0 - Task 3: takes 1 minute → finishes at time = 5 + 1 = 6 → deadline = 3 → lateness = 6 - 3 = 3 ❗

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;

}

I like your task scheduling code. Can I integerate this algorithm on my website which is related account deletion

Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Task Scheduling Problem Solution

My C++ solution:

map<int,int> mp = {{0,0}};                  //d->exceed
map<int,int>::iterator maxdif = mp.begin();   //iterator to mp item with most exceed


map<int,int>::iterator getIterator(int d) {
    if (d<=maxdif->first) return maxdif;
    auto iv = mp.insert({d,0});
    auto it =iv.first;
    if (iv.second) {    //new d;
        auto previt = it;
        previt--;
        it->second = previt->second+previt->first-it->first;
    }
    return it;
}

int taskScheduling(int d, int m) {
    map<int,int>::iterator it = getIterator(d);
    while (it!=mp.end()) {
        it->second += m;
        if (it->second > maxdif->second) {
            maxdif=it;
        }
        it++;
    }
    return maxdif->second;
}