活动安排问题：给出各项活动的起始时间与结束时间，列出一系列不冲突且最大利用空间的活动，算法采用的是贪心算法-Activity Arrangement Problem: Giving the start time and end time of each activity, list a series of activities which are not conflict and use the space maximally. The algorithm adopts greedy algor