task scheduling problem

Maximize task profits by their ddl.  input: [(taskName, ddl, profit)], output: ([taskOrder], maxProfit)

每个task只需要花一天时间，一天只可以做一个task

def maximize_task_profits(tasks):
    if not tasks:
        return [], 0

    tasks.sort(key=lambda x: x[2], reverse=True)
    max_deadline = max(task[1] for task in tasks)
    # 时间槽，从 1 开始
    slots = [None] * (max_deadline + 1)

    total_profit = 0

    for name, ddl, profit in tasks:
        for day in range(ddl, 0, -1):
            if slots[day] is None:
                slots[day] = name
                total_profit += profit
                break

    task_order = [task for task in slots[1:] if task is not None]

    return task_order, total_profit