Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 406 Weeks Ago, 1 Day Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 16 Sep 2017 My Price 10.00

obedient student

Rahul is a very obedient student and do all the work given by his teacher. His teacher give a number of assignments everyday in such a way that each assignments have starting time as well as finishing time. The total time to complete the assigments is between the smallest starting time and largest finishing time(inclusive). Only problem was that, students could only do one assignment at a time and cheating was strictly not allowed.

Rahul always got the highest marks as he is able to complete the maximum number of assignments each day.One of his friend wants to find out how many assignments did he completes everyday but don't know how, So he needs your help in this.

Input

First line contains an integer t denoting the number of testcases.
Each test case contains three lines.
First line contains 'n' total number of assignments.
Second line contains starting time for each assignment.
Third line contains finishing time for each assignment.

  • 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 total assignments.
  • The second line contains N space-separated integers A1, A2, ..., AN denoting the starting time of assignments.
  • The third line contains N space-separated integers B1, B2, ..., BN denoting the finishing time of assignments.

Output

For each test case print maximum number of assignments Rahul completes.

Constraints

  • 1 = T = 1200
  • 2 = N = 100000
  • 2 = A = 100000
  • 2 = B = 100000

Example

Input: 2 5 2 4 3 1 5 3 7 5 6 8 3 1 5 4 7 6 5 Output: 3 2

Explanation

Example case 1. He completes assignment 1(2,3) ,3(3,5),5(5,8)

Answers

(5)
Status NEW Posted 16 Sep 2017 01:09 PM My Price 10.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)