贪心之------Tea Party

qq_970313613

于 2019-08-01 16:06:55 发布

阅读量350

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/qq_33961229/article/details/98068672

版权

该博客讨论了一道关于如何公平分配茶水给不同容积杯子的问题，需要满足每个杯子至少装满一半且不浪费茶水。博主首先尝试了一种错误的贪心策略，然后意识到应该按照杯子容积大小依次倒水，并确保不超过杯子的容积。最后提到了错误代码和正确解法。

摘要由CSDN通过智能技术生成

这道题大致意思就是N个杯子的容积和茶壶的容积，要满足三个条件（1.每一个杯子里面的茶必须严格大于它容积的一半 2.茶壶往所有杯子到满水后没有生于地茶 3.所有的客人必须满意）使客人满意的话，就是一个杯子里面的茶水必须大于任意一个容积小于它的杯子里面的茶水

Tea Party
Polycarp invited all his friends to the tea party to celebrate the holiday. He has n cups, one for each of his n friends, with volumes a1, a2, …, an. His teapot stores w milliliters of tea (w ≤ a1 + a2 + … + an). Polycarp wants to pour tea in cups in such a way that:

Every cup will contain tea for at least half of its volume
Every cup will contain integer number of milliliters of tea
All the tea from the teapot will be poured into cups
All friends will be satisfied.
Friend with cup i won’t be satisfied, if there exists such cup j that cup i contains less tea than cup j but ai > aj.

For each cup output how many milliliters of tea should be poured in it. If it’s impossible to pour all the tea and satisfy all conditions then outpu