题解

按结尾时间排序，再检测一下有没有时间冲突即可

#include <iostream>
#include <algorithm>
using namespace std;
struct act{
	int start, end;
}a[10005];
bool cmp(act a, act b){
	return a.end < b.end;
}int ct;
int ed;
int t;
int main(){
    int t;
    cin >> t;
    while(t--){
        int n;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i].start >> a[i].end;
	}sort(a + 1, a + n + 1, cmp);
	ct = 1;
	ed = a[1].end;
	for(int i = 2; i <= n; i++){
		if(a[i].start > ed){
			ct++;
			ed = a[i].end;
		}
	}cout << ct << endl;
    }
	
	
	return 0;
}