hdu1052

#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;
bool cmp(int x,int y)
{
      return x>y;//似乎降序也可以
}
int main()
{
      int a[2020],b[1010],n,max;
      while(cin>>n&&n)
      {
           for(int i=0;i<n;i++)
           {
                 cin>>a[i];
           }
           for(int i=0;i<n;i++)
           {
                 cin>>b[i];
           }
           sort(a,a+n,cmp);
           sort(b,b+n,cmp);
           for(int i=n;i<2*n;i++)
           {
                 a[i]=a[i-n];
           }
           max=-1000000;
           for(int i=0;i<n;i++)
           {
                 int t=0;
                 for(int j=0;j<n;j++)
                 {
                       if(a[i+j]>b[j])
                           t++;
                       if(a[i+j]<b[j])
                           t--;//平局不输不赢
                 }
                 if(t>max)
                       max=t;
           }
           cout<<200*max<<endl;
      }
      system("pause");
      return 0;
}