杭电acm2037：尽可能多的看电视节目

#include <iostream>
using namespace std;
struct program{
int start_time;
int end_time;
};
int main(){
int n;
while (cin >> n && n != 0){
program a[100];
int b[100] = { 0 };
program temp;
for (int i = 0; i < n; i++)
cin >> a[i].start_time >> a[i].end_time;
//按结束时间从小到大排列节目
for (int i = 0; i < n; i++){
for (int j = i ; j < n; j++){
if (a[i].end_time > a[j].end_time){
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
//排列完的第一个节目为起始节目
//找最近的(结束最早的)，上个节目结束后能看的
int cont = 1;
temp = a[0];
for (int i = 1; i < n; i++){
if (a[i].start_time >= temp.end_time){
cont++;
temp = a[i];
}
}
cout << cont << endl;
}
return 1;
}