Tier Task Count Sum - Google OA IIIT Allahabad

You are given an array time of N integers, where time[i] is the time required for the i-th task. You are also given K tier limits in an array tier. For each tier tier[j], all tasks with time[i] ≤ tier[j] belong to that tier. A task may belong to multiple tiers. Compute the total number of task occurrences across all tiers.

Input

First line: N
Second line: K
Third line: N space-separated integers time[i]
Fourth line: K space-separated integers tier[j]

Output

Print a single integer: the total count.

Example 1:

Input:[5,3,[10,20,30,40,50],[25,50,100]]

Output:12

Constraints:

1 ≤ N, K ≤ 2*10^5
1 ≤ time[i], tier[j] ≤ 10^9

solution.cpp

Run code to see test results

00:00 / 69:42

Tier Task Count Sum - Google OA IIIT Allahabad

EasyMed•1,146 views

Input

First line: N
Second line: K
Third line: N space-separated integers time[i]
Fourth line: K space-separated integers tier[j]

Output

Print a single integer: the total count.

Example 1:

Input:[5,3,[10,20,30,40,50],[25,50,100]]

Output:12

Constraints:

1 ≤ N, K ≤ 2*10^5
1 ≤ time[i], tier[j] ≤ 10^9

EasyMed•1,146 views

Time Complexity

Space Complexity

Asked at

Google

Author: Amit Dayal

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.