1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
| #include<stdio.h> #include<algorithm> #include<map> #include<queue> #include<vector> #include<string.h> #include<stack>
#define mem(ss) memset(ss,0,sizeof(ss)) #define fo(d, s, t) for(int d=s;d<=t;d++) #define fo0(d, s, t) for(int d=s;d>=t;d--) typedef long long ll; typedef long double ld; typedef double db; const ll mod = 998244353; #define io_opt ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) using namespace std;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
inline int read() { int data = 0; char ch = 0; while (ch < '0' || ch > '9') ch = getchar(); while (ch >= '0' && ch <= '9') data = data * 10 + ch - '0', ch = getchar(); return data; } db fab(db x) { return x > 0 ? x : -x; } int n,m,T; struct E{ int s,t; }e[100020]; int cmp(E x,E y){ if(x.t==y.t) return x.s<y.s; return x.t<y.t;
} int main() { scanf("%d",&T); while(T--){ scanf("%d%d",&n,&m); fo(i,1,n){ scanf("%d%d",&e[i].s,&e[i].t); } sort(e+1,e+1+n,cmp); int las=0,ans=0; fo(i,1,n){ if(e[i].s>=las){ ans++; las=e[i].t; }
} printf("%d\n",ans); }
return 0; }
|