Moving Tables

#include “math.h” #include “stdlib.h” #include<iostream> using namespace std; int comp(const void*p1,const void *p2) { return (*((int *)p1))>(*((int *)p2))?-1:1; } int main() { int corridor[200]; int T,N; cin>>T; for(int p=0;p<T;p++) { memset(corridor,0,200*sizeof(int)); cin>>N; for(int q=0;q<N;q++) { int left,right; cin>>left; cin>>right; left–; right–; if((right/2)<(left/2)) { int temp=right/2; right=left/2; left=temp; } else { left=left/2; right=right/2; } for(int i=left;i<=right;i++) { corridor[i]++; } } qsort(corridor,200,sizeof(int),comp); cout<<corridor[0]*10<<endl; } system(“pause”); return 0; }