#include <iostream>
#include <cstring>
#include <stdio.h>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#define maxn 0x7fffffff
using namespace std;
int corridor[201];
int main()
{
int T,N,left,right;
cin>>T;
while(T--)
{
memset(corridor,0,sizeof(corridor));
cin>>N;
for(int i=0;i<N;i++)
{
cin>>left>>right;
if(left>right)
{
int temp=left;
left=right;
right=temp;
}
left=(left+1)/2;
right=(right+1)/2;
for(int i=left;i<=right;i++)
{
corridor[i]++;
}
}
int maxnum=-maxn;
for(int i=1;i<=200;i++)
{
if(maxnum<corridor[i])
{
maxnum=corridor[i];
}
}
cout<<maxnum*10<<endl;
}
return 0;
}
水题
最新推荐文章于 2023-12-10 19:53:33 发布