BETA

Difficulty Level: Easy

Submissions: 4799 Accuracy:

28.07%

Activity Selection
     

Given N activities with their start and finish times. Select the maximum number of activities that can be performed by a single person, assuming that a person can only work on a single activity at a time.

Note : The start time and end time of two activities may coincide.

Input:
The first line contains T denoting the number of testcases. Then follows description of testcases. First line is N number of activities then second line contains N numbers which are starting time of activies.Third line contains N finishing time of activities.
 
Output:
For each test case, output a single number denoting maximum activites which can be performed in new line.

 

Constraints:
1<=T<=50
1<=N<=1000
1<=A[i]<=100

 

Example:
Input:
1
6
1 3 0 5 8 5
2 4 6 7 9 9

Output:
4

** For More Input/Output Examples Use 'Expected Output' option **

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.