def min_intervals_to_cover(points):
    if not points:
        return 0

    points.sort(key=lambda x: x[1])  # 按照区间的右端点进行排序
    intervals = [points[0]]
    covered_point = points[0][1]

    for interval in points[1:]:
        if interval[0] > covered_point:
            intervals.append(interval)
            covered_point = interval[1]

    return intervals

intervals = [(1, 3), (2, 4), (3, 6), (5, 7), (8, 10)]
result = min_intervals_to_cover(intervals)
print("最少区间覆盖方式：", result)