Counting Kangaroos is Fun

M - Counting Kangaroos is Fun

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

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.

Sample Input

Input

8
2
5
7
6
9
8
4
2

Output

5

Input

8
9
1
6
2
6
5
8
3

Output

5

<pre name="code" class="cpp">#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<stack>
#include<iostream>
#include<algorithm>
using namespace std; 
int a[1000100];
int main()
{
    int i,n,h;
    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
        sort(a,a+n);
        int ans=n;
        h=n-1;
        for(i=n/2-1;i>=0;i--)
        {
            if(a[i]*2<=a[h])
            {
                ans--;
                h--;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}
//这题仿佛在逗我-.- 
//最开始写的。。。想着咋能每个人只对战一次都想疯了。。。然而最后决定不用二分-.- 直接模拟 
/*
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<stack>
#include<iostream>
#include<algorithm>
using namespace std; 
int main(){
	int a[100001];
	a[0] = 0;
	int n;
	while(scanf("%d",&n),n){
		for(int i = 1; i <= n; i++){
			scanf("%d",&a[i]);
		}
		sort(a+1,a+n+1);
		
		int flag = n;
		int l = 0,r = n;
		int ccc = 100;
		
		while(ccc--){
			int mid = (l+r)/2;
			if(2*a[mid] <= a[n]){
				if(n-mid < flag){
					flag = n-mid;
				}
				l = mid;
			}
			else{
				r = mid;
			}
		}
		
		printf("%d\n",flag);
		
	}
} */