5124 lines

 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <algorithm>
 4 #include <cstring>
 5 #include <string.h>
 6 #include <math.h>
 7 #include <queue>
 8 #include <stack>
 9 #include <stdlib.h>
10 #include <map>
11 using namespace std;
12 #define LL long long
13 #define sf(a) scanf("%d",&(a));
14 #define N 500010
15 
16 struct LNode{
17     int x,flag;
18 }f[N];
19 int cmd(struct LNode x,struct LNode y){
20     if(x.x==y.x) return x.flag>y.flag;
21     return x.x<y.x;
22 }
23 int main()
24 {
25     int n,t;
26     scanf("%d",&t);
27     while(t--){
28         //memset(f,0,sizeof(f));
29         scanf("%d",&n);
30         for(int i=0;i<2*n;i=i+2) {
31             int x,y;
32             scanf("%d %d",&x,&y);
33             f[i].x=x;f[i].flag=1;
34             f[i+1].x=y+1;f[i+1].flag=2;
35         }
36         sort(f,f+2*n,cmd);
37         int maxc=-1;int num=0;
38         for(int i=0;i<n*2;i++){
39             if(f[i].flag==1) num++;
40             else num--;
41             if(num > maxc) maxc = num;
42         }
43         printf("%d\n",maxc);
44     }
45 
46     return 0;
47 }