hdu 1052 Tian Ji -- The Horse Racing拜托能来指教一下吗。。

#include<stdio.h>
void sort(int b[],int lef,int rig)
{
int le,ri,temp;
temp=b[lef];
le=lef;
ri=rig;
while(le<ri)
{
while(b[ri]<=temp&&le<ri)
ri--;
b[le]=b[ri];
while(b[le]>=temp&&ri>le)
le++;
b[ri]=b[le];
}
b[le]=temp;
if(le>lef)
sort(b,lef,ri-1);
if(ri<rig)
sort(b,ri+1,rig);
}
int main(){
int n,i,j,count,over,count1;
int wf[1000],df[1000];
while(~scanf("%d",&n)){
if(n==0){
break;
}
for(i=0;i<n;i++){
scanf("%d",&wf[i]);
}
for(i=0;i<n;i++){
scanf("%d",&df[i]);
}
sort(wf,0,n-1);sort(df,0,n-1);
count=0;over=0;count1=0;
/**----------------------------------------------------------*/
for(i=0;i<n;i++){
for(j=0;j<n-count-count1;j++){
/**----------------------------------------------------------*/
if(j==n-count-count1-1){
if(wf[i]<df[j]){
over=1;
break;
}
else if(wf[i]==df[j]){
count1++;
df[j]=0;
sort(df,0,n-1);
break;
}
}
/**----------------------------------------------------------*/
if(wf[i]>df[j]){
count++;
df[j]=0;
sort(df,0,n-1);
break;
}
}
if(over==1)break;
}
/**----------------------------------------------------------*/
printf("%d\n",count*200-((n-count-count1)*200));
}
return 0;
}