区间贪心 节目安排

//按结束时间早的排序,留下更多的时间给后续节目

#define _CRT_SECURE_NO_WARNINGS

#include <cstdio>

#include <iostream>

#include <algorithm>

using namespace std;

struct program {

int start;

int end;

};

const int maxn = 1000;

program arr[maxn];

bool compare(program x, program y) {

return x.end < y.end;

}

int main() {

int n;

while (scanf("%d", &n) != EOF) {

if (n == 0) {

break;

}

for (int i = 0; i < n; i++) {

scanf("%d%d", &arr[i].start, &arr[i].end);

}

sort(arr, arr + n, compare);

int current = 0; //记录上个节目结束时间

int answer = 0;

for (int i = 0; i < n; i++) {

if (current <= arr[i].start) { //<=

current = arr[i].end;

answer++;

}

}

printf("%d\n", answer);

}

return 0;

}