1 def maximize_task_profits(tasks):
 2     if not tasks:
 3         return [], 0
 4 
 5     tasks.sort(key=lambda x: x[2], reverse=True)
 6     max_deadline = max(task[1] for task in tasks)
 7     # 时间槽，从 1 开始
 8     slots = [None] * (max_deadline + 1)
 9 
10     total_profit = 0
11 
12     for name, ddl, profit in tasks:
13         for day in range(ddl, 0, -1):
14             if slots[day] is None:
15                 slots[day] = name
16                 total_profit += profit
17                 break
18 
19     task_order = [task for task in slots[1:] if task is not None]
20 
21     return task_order, total_profit