CF372A.Counting Kangaroos is Fun

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

The first line contains a single integer — $n$ $(1<=n<=5·10^{5})$ . Each of the next $n$ lines contains an integer $s_{i}$ — the size of the $i$ -th kangaroo $(1<=s_{i}<=10^{5})$ .

输出格式

Output a single integer — the optimal number of visible kangaroos.

输入输出样例

输入#1
```
8
2
5
7
6
9
8
4
2
```
输出#1
```
5
```
输入#2
```
8
9
1
6
2
6
5
8
3
```
输出#2
```
5
```

首页