POJ-1083

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <algorithm>
#include <iostream>
using namespace std;
struct work
{
    int start;
    int finish;
    int use;
};
work base_arr[217];
int line_arr[217];

int main()
{
//    freopen("in.in", "r", stdin);
    int t, n, i, j, k;
    while(scanf("%d", &t) != EOF)
    {
        while(t--)
        {
            scanf("%d", &n);
            int maxc = 0;
            memset(base_arr, 0, sizeof(base_arr));
            memset(line_arr, 0, sizeof(line_arr));
            for(i = 0; i < n; ++i)
            {
                scanf("%d %d", &base_arr[i].start, &base_arr[i].finish);
                if(base_arr[i].start > base_arr[i].finish) swap(base_arr[i].start, base_arr[i].finish);
                if(base_arr[i].start % 2 != 0) base_arr[i].start = base_arr[i].start / 2 + 1;
                else base_arr[i].start = base_arr[i].start / 2;
                if(base_arr[i].finish % 2 != 0) base_arr[i].finish = base_arr[i].finish / 2 + 1;
                else base_arr[i].finish = base_arr[i].finish / 2;
                for(j = base_arr[i].start; j <= base_arr[i].finish; ++j)
                {
                    line_arr[j] += 1;
                }
            }
            int num = 0, countc = 0;
            for(i = 1; i <= 210; ++i)
            {
                maxc = max(line_arr[i], maxc);
            }
            printf("%d\n", maxc * 10);
        }
    }
return 0;
}