zoj 1029 Moving Tables

水题，不解释。。。。

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define type int
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
#define M 205
struct data{
int l,r,f;
}a[2*M];
int n,now,flag,t;
int cmp(const data &x,const data &y){
if(x.l<y.l)return 1;
else if(x.l==y.l){
if(x.r<y.r)return 1;
else return 0;
}else return 0;
}
int main(){
    int T,i,x,y;
    scanf("%d",&T);
    while(T--){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d",&x,&y);
if(x>y){t=x;x=y;y=t;}
if(x%2==1)x+=1;
if(y%2==1)y+=1;
a[i].l=x/2,a[i].r=y/2;
a[i].f=0;
}
sort(a,a+n,cmp);
now=0,flag=1;
while(flag!=0){
flag=0;t=-1;
for(i=0;i<n;i++)
if(flag==0){
if(a[i].f==0){
now+=10;
t=i;
flag=1;
a[i].f=1;
}
}else{
if(a[i].f==0&&a[i].l>a[t].r){
a[i].f=1;
t=i;
}
}
}
printf("%d\n",now);
}
    return 0;
}