Kitchen Timetable

All submissions for this problem are available.
Read problems statements in Mandarin Chinese, Russian and Vietnamese as well.
There are N students living in the dormitory of Berland State University. Each of them sometimes wants to use the kitchen, so the head of the dormitory came up with a timetable for kitchen's usage in order to avoid the conflicts:
 The first student starts to use the kitchen at the time 0 and should finish the cooking not later than at the time A_{1}.
 The second student starts to use the kitchen at the time A_{1} and should finish the cooking not later than at the time A_{2}.
 And so on.
 The Nth student starts to use the kitchen at the time A_{N1} and should finish the cooking not later than at the time A_{N}
The holidays in Berland are approaching, so today each of these N students wants to cook some pancakes. The ith student needs B_{i} units of time to cook.
The students have understood that probably not all of them will be able to cook everything they want. How many students will be able to cook without violating the schedule?
Input
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
The first line of each test case contains a single integer N denoting the number of students.
The second line contains N spaceseparated integers A_{1}, A_{2}, ..., A_{N} denoting the moments of time by when the corresponding student should finish cooking.
The third line contains N spaceseparated integers B_{1}, B_{2}, ..., B_{N} denoting the time required for each of the students to cook.
Output
For each test case, output a single line containing the number of students that will be able to finish the cooking.
Constraints
Should contain all the constraints on the input data that you may have. Format it like:
 1 ≤ T ≤ 10
 1 ≤ N ≤ 10^{4}
 0 < A_{1} < A_{2} < ... < A_{N} < 10^{9}
 1 ≤ B_{i} ≤ 10^{9}
Example
Input: 2 3 1 10 15 1 10 3 3 10 20 30 15 5 20 Output: 2 1
Explanation
Example case 1. The first student has 1 unit of time  the moment 0. It will be enough for her to cook. The second student has 9 units of time, but wants to cook for 10 units of time, and won't fit in time. The third student has 5 units of time and will fit in time, because needs to cook only for 3 units of time.
Example case 2. Each of students has 10 units of time, but only the second one will be able to fit in time.
Author:  xcwgf666 
Tester:  
Editorial  http://discuss.codechef.com/problems/KTTABLE 
Tags  array, cakewalk, loop, snckql16, xcwgf666 
Date Added:  24052016 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions