Practice
Resources
Contests
Online IDE
New
Free Mock
Events New Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
Events
Attend free live masterclass hosted by top tech professionals
New
Scaler
Explore Offerings by SCALER

# Request X Chocolates

Problem Description

There are some children, each child having a unique id requesting different quantity of chocolate in the given order denoted by 2D matrix A of size `N x 2` where A[i][0] denotes chidren id and A[i][1] denotes quantity.

A child can request any quantity of chocolate multiple times. The person distributing the chocolate has only B chocolates.

You are asked to find the maximum value of X such that each children can request a total sum of at most X chocolates and total chocolates requested by all children is not more than B.

NOTE:

• The request made either be served fully or not. It can't be fulfilled partially.
• For each child, request are served sequentially, i.e any child can't make a new request before completing the previous request.
• For each child, the total sum of chocolate he/she recieved should not be greater than X.

• Problem Constraints

1 <= N <= 105

1 <= A[i][0], A[i][1], B <= 109

B < Sum of all requested quantity

Input Format

First argument is a 2d array A of size N x 2 denoting that A[i][0] child is requesting A[i][1] quantity of chocolate.

Second argument is an integer B denoting the total quantity of chocolates.

Output Format

Return an integer denoting the maximum value of X.

Example Input

Input 1:

``` A = [
[1, 2]
[2, 1]
[1, 4]
[2, 9]
[1, 1]
[3, 2]
]
B = 6```

Input 2:

``` A = [
[10, 2]
[10, 5]
[4, 4]
[4, 1]
]
B = 1```

Example Output

Output 1:

` 5`

Output 2:

` 1`

Example Explanation

Explanation 1:

``` Each children can get at most 5 chocolates such that the total sum of chocolates recieved is less than 6.
Child with id 1: will get 2 chocolates in first request. Any other request will not be fulfilled.
Child with id 2: will get 1 chocolate in first request. Any other request will not be fulfilled.
Child with id 3: will get 2 choclates in first request.
Total chocolate = 5 which is less than 6.
NOTE: We can't increase the value of X to 6. Second request of child 1 will get fulfilled at total chocolates will be greater than 6.
```

Explanation 2:

` The maximum value of X is 1.`

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.
Hints
• Hint 1
• Solution Approach
• Complete Solution

## Discussion

Free Mock Assessment
Fill up the details for personalised experience.
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
*Enter the expected year of graduation if you're student
Current Employer
Company Name
College/University Name
Job Title
Job Title
Software Development Engineer (Backend)
Software Development Engineer (Frontend)
Software Development Engineer (Full Stack)
Data Scientist
Android Engineer
iOS Engineer
Devops Engineer
Support Engineer
Research Engineer
Engineering Intern
QA Engineer
Co-founder
SDET
Product Manager
Product Designer
Backend Architect
Program Manager
Release Engineer