2019 ACM 排序

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{
    int n,a[101],b[101],i,A,B;
    while(scanf("%d",&n)!=EOF&&n)
    {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
        for(i=0;i<n;i++)
            scanf("%d",&b[i]);
        sort(a,a+n);
        sort(b,b+n);
        for(A=B=0,i=0;i<n;i++)
        {
            if(a[i]>b[i])
                A+=2;
             if(a[i]<b[i])
                B+=2;
             if(a[i]==b[i])
             {
                 A++;
                 B++;
             }
        }
         printf("%d vs %d\n",A,B);
    }
}