Submission #2124593

---

Source Code Expand

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
#define N 10010
int a[N],b[N],c[N];
int main()
{
    long long s1,s2;
    int i,j,k,n;
    s1=0;
    s2=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(i=1;i<=n;i++)
        scanf("%d",&b[i]);
    for(i=1;i<=n;i++)
        c[i]=a[i]-b[i];
    sort(c+1,c+n+1);
    for(i=1;i<=n;i++)
    {
        if(c[i]>0)
            break;
        s1=s1+c[i]/2;
    }
    for(;i<=n;i++)
        s2=s2+c[i];
    s1=fabs(s1);
    if(s1<s2)
        printf("No\n");
    else
        printf("Yes\n");
    //printf("%lld %lld\n",s1,s2);
    return 0;
}

Submission Info

Judge Result