2 051
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
Hi Rafi , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅
👇👇
@offcampusjobs_0
@offcampusjobs_0
02 4月 2021, 02:22
Geek goes to a toy shop having N toys, the prices of these toys are given as price array. He wants to buy all the N toys, but he has only M rupees to spend. He has a magical Trident which reduces the price of each toy. This reduced price for each toy is given in magical_price array. That is for ith toy (1<=i<=N) price[i] is the original price and magical_price[i] is the price after applying magic. Since applying magic reduces the power of Trident, he wants to apply it as minimum times as possible.
Find the minimum number of toys on which he should apply this magic so as to buy all the N toys for atmost M rupees. If it is not possible for Geek to buy the toys even after applying the magic on all the toys the return -1.
Example 1:
Input:
N = 5, M = 13
price = {3,4,6,2,4}
magical_price = {1,2,5,1,3}
05 7月 2023, 11:38
Hi Madireddy , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅
👇👇
@offcampusjobs_0
@offcampusjobs_0
31 3月 2021, 03:06
Hi N Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
24 1月 2022, 09:07
Hi Brishtite Subscribe Our YouTube Channel 📣 for Daily Jobs Updates and Study Material 🔥
10 8月 2021, 00:21
Hi sahil Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
12 1月 2022, 22:34
