527. Happy Array
0
Medium
Ravi gave a task to Mohan. He has given two arrays A and B, he has to arrange the elements of array A such that the happiness of the array is maximum.
The Happiness of an array is defined as the number of indices i for which A[i]>B[i].
The Happiness of an array is defined as the number of indices i for which A[i]>B[i].
Input Format
The first line contains N ( 1 <= N <= 1e5).
The second line contains N integer - Array A.
The third line contains N integer - Array B.
Output Format
Output the maximum happiness of the array.
Example
Input
4
2 7 11 15
1 10 4 11
Output
4
Constraints
1 <= N<= 1e5
A.length == B.length
0 <= A[i], B[i] <= 109
A.length == B.length
0 <= A[i], B[i] <= 109
Loading...
View Submissions
Console