Ticket Counter

Problem Description

There is a line at Ticket Counter of N people.

Each person has a patience level A[i] which if reaches 0, the person leaves the line. Also, It takes B[i] amount of time to process the tickets for the ith person.

In each unit time patience level of each person in line drop by 1.

The ticket counter wants to know the number of customers who will leave the line.

Note: If the person reaches the front just at the moment it's patience reaches 0, it will not leave the line.

Problem Constraints

1 <= N <= 100000
1 <= A[i]<= 1000000000
1 <= B[i]<= 100000

Input Format

First argument of input is an integer array A. Second argument of input is an integer array B.

Output Format

Return a single integer denoting number of people who leave the line.

Example Input

Input 1:

A = [1, 7, 6, 5], B = [3, 3, 3, 1]

Input 2:

A = [1], B = [10]

Example Output

Output 1:

Output 2:

Example Explanation

Explanation 1:

    At time 0, person 1 is served at ticket counter.
    At time 3, person 1 leaves counter and person 2 is served at ticket counter.
    At time 5, person 4 patience level reaches 0 and leaves the line.
    At time 6, person 2 leaves counter and person 3 is served at ticket counter.
    At time 9, person 3 leaves counter.

Explanation 2:

   At time 0, person 1 is served at ticket counter and leaves at time 10.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Ticket Counter on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Ticket Counter

Discussion