Problem:
Score : 400 points

Problem Statement

A university student, Takahashi, has to take N examinations and pass all of them.
Currently, his readiness for the i-th examination is A_{i}, and according to his investigation, it is known that he needs readiness of at least B_{i} in order to pass the i-th examination.

Takahashi thinks that he may not be able to pass all the examinations, and he has decided to ask a magician, Aoki, to change the readiness for as few examinations as possible so that he can pass all of them, while not changing the total readiness.

For Takahashi, find the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the following conditions:

The sum of the sequence A_1, A_2, ..., A_{N} and the sum of the sequence C_1, C_2, ..., C_{N} are equal.

For every i, B_i \leq C_i holds.

If such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.

Constraints

1 \leq N \leq 10^5

1 \leq A_i \leq 10^9

1 \leq B_i \leq 10^9

A_i and B_i 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

Print the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the conditions.
If such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.

Sample Input 1

3
2 3 5
3 4 1

Sample Output 1

3

(A_1, A_2, A_3) = (2, 3, 5) and (B_1, B_2, B_3) = (3, 4, 1). If nothing is done, he cannot pass the first and second exams.
The minimum possible number of indices i such that A_i and C_i are different, 3, is achieved when:

(C_1, C_2, C_3) = (3, 5, 2)

Sample Input 2

3
2 3 3
2 2 1

Sample Output 2

0

In this case, he has to do nothing in order to pass all the exams.

Sample Input 3

3
17 7 1
25 6 14

Sample Output 3

-1

In this case, no matter what is done, he cannot pass all the exams.

Sample Input 4

12
757232153 372327760 440075441 195848680 354974235 458054863 463477172 740174259 615762794 632963102 529866931 64991604
74164189 98239366 465611891 362739947 147060907 118867039 63189252 78303147 501410831 110823640 122948912 572905212

Sample Output 4

5

Solution in Fortran (gfortran v4.8.4) (judge verdict: Time Limit Exceeded)

program keyence2019
  implicit none
  integer n, i, ans
  integer(8) s
  integer(8), dimension(:), allocatable :: a, b, c

  read *, n
  allocate(a(n), b(n), c(n))
  read *, a, b
  c = a - b
  c = sort_desc(c)
  s = sum(pack(c, c < 0))
  ans = count(c < 0)
  do i = 1, n
     if (s >= 0 .or. c(i) <= 0) exit
     s = s + c(i)
     ans = ans + 1
  end do
  if (s < 0) then
     print '(a)', '-1'
  else
     print '(i0)', ans
  end if
contains
  recursive function sort_desc(a) result(res)
    integer(8), dimension(:), allocatable :: res, l, r
    integer(8), dimension(:), intent(in) :: a
    integer p

    if (size(a) < 2) then
       res = a
    else
       p = size(a) / 2
       l = [pack(a(1:p-1), a(1:p-1) > a(p)), pack(a(p+1:), a(p+1:) > a(p))]
       r = [pack(a(1:p-1), a(1:p-1) <= a(p)), pack(a(p+1:), a(p+1:) <= a(p))]
       res = [sort_desc(l), a(p), sort_desc(r)]
    end if
  end function sort_desc
end program keyence2019