贪心算法选择不相交区间

 1 #include<iostream>
 2 using namespace std;
 3 int main()
 4 {
 5     int n,count,temp;
 6     int a[100], b[100];
 7     while (cin >> n&&n)
 8     {
 9         count = 1;
10         for (int i = 0; i < n; i++)
11         {
12             cin >> a[i] >> b[i];
13         }
14         for (int i = 0; i < n; i++)
15         {
16             for (int j = i; j < n; j++)
17             {
18                 if (b[j] < b[i])  { temp = b[i]; b[i] = b[j]; b[j] = temp; temp = a[i]; a[i] = a[j]; a[j] = temp; }
19             }
20         }
21         int k = 0;
22         for (int i = 1; i < n; i++)
23         {
24             if (a[i] >= b[k])  { count++; k = i; }
25         }
26         cout << count << endl;
27     }
28     return 0;
29 }