CodeForces 253B Physics Practical

Description

input

input.txt

output

output.txt

One day Vasya was on a physics practical, performing the task on measuring the capacitance. He followed the teacher's advice and did as much as n measurements, and recorded the results in the notebook. After that he was about to show the results to the teacher, but he remembered that at the last lesson, the teacher had made his friend Petya redo the experiment because the largest and the smallest results differed by more than two times. Vasya is lazy, and he does not want to redo the experiment. He wants to do the task and go home play computer games. So he decided to cheat: before Vasya shows the measurements to the teacher, he will erase some of them, so as to make the largest and the smallest results of the remaining measurements differ in no more than two times. In other words, if the remaining measurements have the smallest result x, and the largest result y, then the inequality y ≤ 2·x must fulfill. Of course, to avoid the teacher's suspicion, Vasya wants to remove as few measurement results as possible from his notes.

Help Vasya, find what minimum number of measurement results he will have to erase from his notes so that the largest and the smallest of the remaining results of the measurements differed in no more than two times.

Input

The first line contains integer n (2 ≤ n ≤ 10⁵) — the number of measurements Vasya made. The second line contains n integersc₁, c₂, ..., c_n (1 ≤ c_i ≤ 5000) — the results of the measurements. The numbers on the second line are separated by single spaces.

Output

Print a single integer — the minimum number of results Vasya will have to remove.

Sample Input

Input

6
4 5 3 8 3 7

Output

2

Input

4
4 3 2 4

Output

0

Hint

In the first sample you can remove the fourth and the sixth measurement results (values 8 and 7). Then the maximum of the remaining values will be 5, and the minimum one will be 3. Or else, you can remove the third and fifth results (both equal 3). After that the largest remaining result will be 8, and the smallest one will be 4.

题意：给你N个数，删去其中若干个，使剩下的数中最大的数小于等于最小的数的两倍，求最少需要删去多少个。

题解：将输入的数排序后，枚举第一个数x，二分找到y（y>(2*x)），需要删去的数即为x之前的数和y之后的数，最小值既为最少需要删去的个数。

#include<stdio.h>
#include<queue>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<assert.h>
#include<stdlib.h>
#include<time.h>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<fstream>
#define pi acos(-1.0)
#define INF 0x3f3f3f3f
#define debug printf("---------------\n");
using namespace std;
int c[100005];

int main()
{
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    int n,ans;

    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&c[i]);
    }
    sort(c,c+n);
    ans=INF;
    for(int i=0;i<n;i++)
    {
        int key=c[i]*2;
        int j=upper_bound(c,c+n,key)-c;

        ans=min((i+(n-j)),ans);
        //printf("%d %d %d\n",c[i],j,ans);
    }
    printf("%d",ans);
    return 0;
}