lines

#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <cmath>#include <vector>#include <queue>#include <map>#include <set>#include <stack>#include <algorithm>using namespace std;typedef long long LL;typedef pair<int,int> pii;#define X first#define Y secondconst int N = 300010 ;const int inf = 1e9+7;int cnt[N] , tot ;struct node {    int x , xx , id ;}e[N];bool cmp1( const node &a , const node &b ){ return a.x < b.x ; }bool cmp2( const node &a , const node &b ){ return a.id < b.id ; }void run() {    memset( cnt , 0 , sizeof cnt ) ;    int n ; tot = 0 ;    scanf("%d",&n);    for( int i = 0 ; i < 2 * n ; ++i ){        scanf("%d",&e[i].x);        e[i].id = i ;    }    sort( e , e + 2 * n , cmp1 );    e[0].xx = 1 ;    for( int i = 1 ; i < 2 * n ; ++i ){        e[i].xx = ( e[i].x == e[i-1].x ? e[i-1].xx : e[i-1].xx + 1 );    }    sort( e, e + 2 * n , cmp2 ) ;    for( int i = 0 ; i < 2 * n ; i += 2 ){        cnt[ e[i].xx ] ++;        cnt[ e[i+1].xx + 1 ] --;    }    int ans = 0 , sum = 0 ;    for( int i = 0 ; i <= 2 * n ; ++i ){        sum += cnt[i];        ans = max( ans , sum ) ;    }    printf("%d\n",ans);}int main(){    #ifdef LOCAL        freopen("in.txt","r",stdin);    #endif // LOCAL    ios::sync_with_stdio(false);    int _ ; scanf("%d",&_);    while( _-- ) run() ;}