Company: Corridor platforms IITM
Difficulty: medium
Maximize K (A[i] > B[i]) Problem Description Given two arrays A and B of size N, you can rearrange elements of A as wish. Find maximum value of k, where k is the number of i satisfying A[i]>B[i]. Constraints N A[i], B[i]