活动安排问题

 1 #include<iostream>
 2 #include<algorithm>
 3 using namespace std;
 4 struct Act
 5 {
 6     int start;
 7     int end;
 8 };
 9 bool compare(Act a,Act b)
10 {
11     return a.end<b.end;//优先选择最早结束的
12 }
13 
14 int main()
15 {
16     int n;
17     while(cin>>n)
18     {
19         Act *act=new Act[n+1];
20         act[0].start=-1;
21         act[0].end=-1;
22         for(int k=1;k<=n;k++)
23             cin>>act[k].start>>act[k].end;
24         sort(act,act+(n+1),compare);
25         int num=0;
26         int i=0;
27         for(int j=1;j<=n;j++)
28         {
29             if(act[j].start>act[i].end)
30             {
31                 i=j;
32                 num++;
33             }
34         }
35         cout<<num<<"\n";
36         delete []act;
37     }
38     return 0;
39 }