All Tracks Algorithms Greedy Algorithms Basics of Greedy Algorithms Problem

In search of Samosa
/

Basic Programming, Sorting, Sorting algorithm

Problem
Editorial
Analytics

Shiro is an avid lover of Samosas. He went down to the Samosa street to have some. But he only has K units of money with him. There are N shops on the street and unfortunately, all of them have only one samosa remaining. You are also given an array A[ ] , where Ai is the cost of a samosa on the i'th shop.
Find the maximum samosas that Shiro can eat.

Input:
First line contains two space-separated integers N and K.
Second line contains N space separated integers, the cost of a samosa on the shops.

Output:
Print the answer.

Constraints:
1 ≤ N ≤ 103
0 ≤ K ≤ 103
0 ≤ Ai ≤ 100

SAMPLE INPUT
4 10
5 4 2 4
SAMPLE OUTPUT
3
Explanation

Shiro can eat from the 2nd,3rd and 4th Shop.

Time Limit: 2.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB

Best Submission

Similar Problems

Contributors

Initializing Code Editor...
Notifications
View All Notifications

?