Problem:
Score : 300 points

Problem Statement

You are given two integer sequences of length N: a_1,a_2,..,a_N and b_1,b_2,..,b_N.
Determine if we can repeat the following operation zero or more times so that the sequences a and b become equal.

Operation: Choose two integers i and j (possibly the same) between 1 and N (inclusive), then perform the following two actions simultaneously:

Add 2 to a_i.

Add 1 to b_j.

Constraints

1 ≤ N ≤ 10 000

0 ≤ a_i,b_i ≤ 10^9 (1 ≤ i ≤ N)

All input values are integers.

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 .. a_N
b_1 b_2 .. b_N

Output

If we can repeat the operation zero or more times so that the sequences a and b become equal, print Yes; otherwise, print No.

Sample Input 1

3
1 2 3
5 2 2

Sample Output 1

Yes

For example, we can perform three operations as follows to do our job:

First operation: i=1 and j=2. Now we have a = \{3,2,3\}, b = \{5,3,2\}.

Second operation: i=1 and j=2. Now we have a = \{5,2,3\}, b = \{5,4,2\}.

Third operation: i=2 and j=3. Now we have a = \{5,4,3\}, b = \{5,4,3\}.

Sample Input 2

5
3 1 4 1 5
2 7 1 8 2

Sample Output 2

No

Sample Input 3

5
2 7 1 8 2
3 1 4 1 5

Sample Output 3

No

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    static long[] as, bs;
    public static void main(String args[]) {
        FastReader sc = new FastReader();
        int n = sc.nextInt();
        as = new long[n];
        bs = new long[n];
        for (int i = 0; i < n; i++)
            as[i] = sc.nextLong();
        for (int i = 0; i < n; i++)
            bs[i] = sc.nextLong();
        long sumA = Arrays.stream(as).sum();
        long sumB = Arrays.stream(bs).sum();
        if (sumA > sumB) {
            System.out.println("No");
            return;
        }
        /*
        List<Long> aList = new ArrayList<>();
        List<Long> bList = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            if (as[i] != bs[i]) {
                aList.add(as[i]);
                bList.add(bs[i]);
            }
        }
        */

        long diffNum = 0;
        for (int i = 0; i < n; i++) {
            if (as[i] > bs[i]) {
                diffNum += (as[i] - bs[i]) * 2;
            } else if (as[i] < bs[i]) {
                diffNum += (bs[i] - as[i]);
            }
        }
        if (diffNum <= sumB - sumA) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        /*
        for (int i = 0; i <= sumB - sumA; i++) {
            if (aList.equals(bList)) {
                System.out.println("Yes");
                return;
            }
            if (i == sumB - sumA) break;
            boolean flaga = false;
            boolean flagb = false;
            for (int j = 0; j < aList.size(); j++) {
                if (flaga && flagb) break;
                if (!flaga && aList.get(j) < bList.get(j)) {
                    flaga = true;
                    aList.set(j, aList.get(j) + 2);
                }
                if (!flagb && aList.get(j) > bList.get(j)) {
                    flagb = true;
                    bList.set(j, bList.get(j) + 1);
                }
            }
        }
        System.out.println("No");
        */
    }

    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt()
        {
            return Integer.parseInt(next());
        }

        long nextLong()
        {
            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
}