CodeForces 372 A Counting Kangaroos is Fun_there are n kangaroos with pockets. each kangaroo -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·105). Each of the next n lines contains an integer si — the size of the i-th kangaroo(1 ≤ si ≤ 105).

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

二分做不动了……直接暴力了这题。

因为最多的情况就是前面的和后面的一对一组成一组，所以滚的时候直接从中间开始滚。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int n;
int a[511111];
int main()
{
	int i,j;
	while(~scanf("%d",&n))
	{
		memset(a,0,sizeof(a));
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		sort(a,a+n);
		int ans=0;
		i=n-1;
		for(j=n/2-1;j>=0;j--)
		{
			if(a[i]>=2*a[j])
			{
				ans++;
				i--;
			}
		}
		printf("%d\n",n-ans);
	}
	return 0;
}