Samosa_love

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 A i  is the cost of a samosa on the ith shop. Find the maximum samosas that Shiro can eat. Input First line contains two space-