HDU 2037 今年暑假不AC(贪心)

局部最优达到整体最优

先把结束时间进行升序排序，开始时间也要保持和原来对应

开始计数应该从1开始，比较时应该是小于等于下一个开始时间就加上



#include<stdio.h>

int main(void)
{
int n, a[105], b[105], i, j, temp, count;

while (scanf("%d", &n) != EOF && n) {
count = 1;
for (i = 0; i < n; i++) {
scanf("%d %d", &a[i], &b[i]);
}

for (int i = 0; i < n-1; i++) {
for (int j = i+1; j < n; j++) {
if (b[i] > b[j]) {
temp = b[i];
b[i] = b[j];
b[j] = temp;
temp = a[i];
a[i] = a[j];
a[j] = temp;

}
}
}

temp = b[0];

for (i = 0; i < n-1; i++) {
for (j = i+1; j < n; j++) {
if (temp <= a[j]) {
i = j;
temp = b[j];
count++;

}
}
}

printf("%d\n", count);
}

return 0;
}