（双指针尺取） CodeForces - 372A Counting Kangaroos is Fun

A. Counting Kangaroos is Fun

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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⁵).

Output

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

Examples

Input

8
2
5
7
6
9
8
4
2

Output

5

Input

8
9
1
6
2
6
5
8
3

Output

5

题意：大袋鼠套小袋鼠，只有是自己两倍以上的袋鼠能套自己，每个袋鼠只能套一只，问最后剩下多少袋鼠。

思路：考虑最好情况，即每只大袋鼠都能套到一只，如：1，2，3，4，5，6；最后只剩3只袋鼠，即对半砍后，看看右边最大能否套下左边最大，能的话两个指针-1，否则左边-1，右边不变。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cstdlib>
#include <algorithm>

using namespace std;
int s[500000+50];

int main()
{
    int n;
    while(~scanf("%d", &n)) {
        int cnt = 0;
        memset(s, 0, sizeof(s));
        for(int i = 0; i < n; i++)
            scanf("%d", &s[i]);
        sort(s, s+n);
        int l = n-1;
        for(int i = n/2 - 1; i >= 0; i--) {
            if(s[i]*2 <= s[l]) {
                cnt++; // 被套下的数量
                l--;
            }
        }
        int ans = n - cnt;
        printf("%d\n" ,ans);
    }
    return 0;
}