cf 670D2 Magic Powder - 2 二分裸题

最新推荐文章于 2017-11-13 21:30:30 发布

原创

最新推荐文章于 2017-11-13 21:30:30 发布 · 999 阅读

2 ·

CC 4.0 BY-SA版权

文章标签：

#acm-二分-cf

本文探讨了二分查找算法在游戏开发中的实际应用，通过实例展示了如何利用二分查找解决游戏逻辑中的问题，提供了游戏开发者进行优化和效率提升的新思路。

D2. Magic Powder - 2
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

Waking up in the morning, Apollinaria decided to bake cookies. To bake one cookie, she needs n ingredients, and for each ingredient she knows the value ai — how many grams of this ingredient one needs to bake a cookie. To prepare one cookie Apollinaria needs to use all n ingredients.

Apollinaria has bi gram of the i-th ingredient. Also she has k grams of a magic powder. Each gram of magic powder can be turned to exactly 1 gram of any of the n ingredients and can be used for baking cookies.

Your task is to determine the maximum number of cookies, which Apollinaria is able to bake using the ingredients that she has and the magic powder.
Input
The first line contains two positive integers n and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ 109) — the number of ingredients and the number of grams of the magic powder.

最低0.47元/天解锁文章