【codeforces 557C Arthur and Table】+ 思维

最新推荐文章于 2020-08-26 15:34:01 发布

原创

最新推荐文章于 2020-08-26 15:34:01 发布 · 639 阅读

0 ·

CC 4.0 BY-SA版权

这篇博客介绍了Arthur如何使他新买的桌子稳定。桌子原本有n条腿，长度分别为li，每条腿移除所需的能量为di。桌子稳定需要超过一半的腿是最长的。任务是找出使桌子稳定的最小能耗。输入包含腿部数量、长度和移除能量，输出是最小能耗。给出了三个示例说明情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

C. Arthur and Table
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Arthur has bought a beautiful big table into his new flat. When he came home, Arthur noticed that the new table is unstable.

In total the table Arthur bought has n legs, the length of the i-th leg is li.

Arthur decided to make the table stable and remove some legs. For each of them Arthur determined number di — the amount of energy that he spends to remove the i-th leg.

A table with k legs is assumed to be stable if there are more than half legs of the maximum length. For example, to make a table with 5 legs stable, you need to make sure it has at least three (out of these five) legs of the maximum length. Also, a table with one leg is always stable and a table with two legs is stable if and only if they have the same lengths.

Your task is to help Arthur and count the minimum n