New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Ravi and Coins

Contributed by

Jaypal Mudaliyar

Medium

0/80

Avg time to solve 30 mins

Success Rate 60 %

0 upvotes

Problem Statement

Ravi is fond of collecting coins. He has ‘N’ boxes with him numbered from ‘0’ to ‘N-1’, initially, all the boxes are empty.

Now for the next ‘M’ days, Ravi adds one coin to each box from ‘[L, R]’, it is denoted by the 2d-array ‘ARR’. (The range ‘L’ to ‘R’ may or may not be the same for each of the ‘M’ days).

Now Deep was very good at maths and being a friend of Ravi he challenged him to answer ‘Q’ questions, denoted by the array ‘QUERIES’ after the ‘M’ days have passed.

Each question will have a number ‘X’ and Ravi has to find the number of boxes having at least ‘X’ coins in it. (i.e. number of boxes having more than or equal to ‘X’ coins).

Now Ravi has found the answers to the questions but is not sure if they are completely correct, So he has asked you to calculate the answers to these questions. Can you help him?.

EXAMPLE :

Input: ‘N’ = 3, ‘M' = 2, ‘Q’ = 1, ‘ARR’ = [[0, 1], [0, 2]], ‘QUERIES’ = [2]

Output: 2
In this case,
After Day 1 number of coins in the boxes will be: [1, 1, 0]
After Day 2 number of coins in the boxes will be: [2, 2, 1]
Hence the boxes having at least ‘2’ coins are Box 0 and Box 1.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input Format :

The first line will contain the integer ‘T’, the number of test cases.

Each test case consists of two lines.

The first line of input contains three integers, ‘N’, ‘M’, and ‘Q’ separated by spaces.

Followed by ‘M’ lines, each line contains two integers, ‘L’ and ‘R’.

Followed by ‘Q’ lines, each line contains one integer, ‘X’.

Output format :

For each test case, print ‘Q’ space separated integers denoting the answers to the ‘Q’ questions asked by Deep.

Note :

You don't need to print anything. It has already been taken care of. Just implement the given function.

Constraints :

1 <= ‘T’ <= 10
1 <= ‘N’ <= 10^5
1 <= ‘M’ <= 10^5
1 <= ‘Q’ <= 10^5
0 <= ‘L’ <= ‘R’ <= ‘N-1’
0 <= ‘X’ <= 10^5
It is guaranteed that sum of ‘N’ over all test cases is <= 10^5
It is guaranteed that sum of ‘M’ over all test cases is <= 10^5
It is guaranteed that sum of ‘Q’ over all test cases is <= 10^5
Time Limit: 1 sec

Sample Input 1 :

Sample Output 1 :

4
7 5

Explanation Of Sample Input 1 :

For the first test case, 
After Day 1 number of coins in the boxes will be: [0, 1, 1, 1, 1]
Hence the boxes having at least ‘1’ coin are Box 1, 2, 3, and 4.

Hence, the output will be: 4

For the second test case,
After Day 1 number of coins in the boxes will be: [1, 1, 1, 1, 0, 0, 0]
After Day 2 number of coins in the boxes will be: [1, 1, 2, 2, 1, 1, 1]
After Day 3 number of coins in the boxes will be: [1, 1, 2, 2, 2, 2, 2]
All the boxes have at least a ‘1’ coin, hence the answer to the ‘1’st question is ‘7’.
The boxes having at least ‘2’ coins are Box 2, 3, 4, 5, and 6.

Hence, the output will be: 7 5

Sample Input 2 :

Sample Output 2 :

2 10 10 
0 8 0 0 8

Auto

Console