Codeforces 373C Counting Kangaroos is Fun(双游标贪心)

最新推荐文章于 2020-07-08 11:59:30 发布

等我学会后缀自动机

最新推荐文章于 2020-07-08 11:59:30 发布

阅读量162

点赞数

分类专栏： Codeforces习题集贪心策略/决策问题

本文链接：https://blog.csdn.net/qq_37451344/article/details/80833407

版权

给定n只袋鼠，每只有大小。一只袋鼠可以放入另一只大小至少是其两倍的袋鼠口袋中。每个袋鼠最多能抱一只袋鼠，被抱的袋鼠无法再抱其他袋鼠。求一种抱袋鼠方案，使得最少有多少只袋鼠能从外部看到。输入为每只袋鼠的大小，输出为最少可见袋鼠数量。

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

There are n kangaroos with pockets. Each kangaroo has a size (integer number). A kangaroo can go into another kangaroo's pocket if and only if the size of kangaroo who hold the kangaroo is at least twice as large as the size of kangaroo who is held.

Each kangaroo can hold at most one kangaroo, and the kangaroo who is held by another kangaroo cannot hold any kangaroos.

The kangaroo who is held by another kangaroo cannot be visible from outside. Please, find a plan of holding kangaroos with the minimal number of kangaroos who is visible.

Input

The first line contains a single integer — n (1 ≤ n ≤ 5·10⁵). Each of the next n lines contains an integer s_i — the size of the i-th kangaroo (1 ≤ s_i ≤ 10⁵).