2680: Problem F

#include<iostream>
using namespace std;
int main()
{
    int n,a[110],b[110],i,j;
    while(scanf("%d",&n)==1)
    {
        for(i=0;i<n;i++) scanf("%d",a+i);
        for(i=0;i<n;i++) scanf("%d",b+i);
        int count=0;
        while(1)
        {
            int flag=1;
            for(i=n-1;i>=0;i--)
            {
                if(a[i]<b[i])
                {
                    flag=0;
                    break;
                }
            }
            if(flag) break;
            int t=i;
            for(i=t-1;i>=0;i--)
            {
                if(a[t]>=b[i]) break;
            }
            int temp=b[i];
            for(j=i;j<t;j++)b[j]=b[j+1];
            b[t]=temp;
            count+=(t-i);
        }
        printf("%d/n",count);
    }
    return 0;
}