HDU-1052

#include <stdio.h>
#include <stdlib.h>
#define max( a, b ) a > b ? a : b
const int maxn = 1005;
int tj[maxn],king[maxn];
int cmp ( const void *p1, const void *p2 ) {
    return *( int * )p1-*( int * )p2;
}
void print ( int a[], int n ) {
    for ( int i = 0; i < n; i ++ )
        printf ( "%d ", a[i] );
    printf ( "\n" );
}
int main () {
    int n,i,j,ans,bj,bk,ej,ek;
    while ( ~scanf ( "%d", &n ) && n ) {
        ans = 0;
        for ( i = 0; i < n; i ++ )
            scanf ( "%d", &tj[i] );
        for ( i = 0; i < n; i ++ )
            scanf ( "%d", &king[i] );
        qsort ( tj, n, sizeof ( tj[0] ), cmp );
        qsort ( king, n, sizeof ( king[0] ), cmp );
        bj = bk = 0;
        ej = ek = n-1;
        for ( i = 0; i < n; i ++ ) {
            if ( tj[bj] > king[bk] ) {
                bj ++;
                bk ++;
                ans ++;
            }
            else if ( tj[ej] > king[ek] ) {
                ej --;
                ek --;
                ans ++;
            }
            else if ( tj[ej] < king[ek] ) {
                bj ++; 
                ek --;
                ans --;
            }
            else if ( tj[ej] == king[ek] )  {
                if ( tj[bj] < king[ek] )   
                    ans --;
                bj ++;
                ek --;
            }
        }
        printf ( "%d\n", ans*200 );
    }
    return 0;
}