pku1083 Moving Tables

#include<stdio.h>
#include<algorithm>
using namespace std;

const int Maxn=405;
int g[Maxn];

int main()
{
    int cases;
    scanf("%d",&cases);
    while(cases--)
    {
        int n;
        scanf("%d",&n);
        memset(g,0,sizeof(g));
        for(int i=1;i<=n;i++)
        {
            int s,t;
            scanf("%d%d",&s,&t);
            if(s>t) swap(s,t);
            if(s%2==0) s--;
            if(t%2==1) t++;
            for(int j=s;j<=t;j++) g[j]++;
        }
        int num=0;
        for(int i=1;i<=400;i++) if(g[i]>num) num=g[i];
        printf("%d\n",num*10);
    }
    return 0;
}