int solve(vector<int> &tasks, int k) {
    int n = tasks.size(), currTime = 0;

    unordered_map<int, int> lastHapp;
    for (int &val : tasks) {
        lastHapp[val] = -1e9;
    }

    for (int &val : tasks) {
        int gap = currTime - lastHapp[val] - 1;
        if (gap < k) {
            currTime += k - gap;
        }
        lastHapp[val] = currTime;
        currTime++;
    }

    return currTime;
}