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·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.
Sample Input
8 2 5 7 6 9 8 4 2
5
8 9 1 6 2 6 5 8 3
5
题意说是有n个袋鼠,口袋A>=2*口袋B,那么这个小袋鼠能被大的袋鼠装下,现在让尽量多的袋鼠被装下,求最后可见袋鼠的最小值;
思路是折半搜索,从中间开始贪心,技巧在于最小的K个袋鼠会被最大的K个所包含。
代码:
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int a[500010];
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+1+n);
int ans=n;
for(int i=n/2;i>=1;i--)
{
if(a[i]*2<=a[ans])//=也满足
{
ans--;
}
}
printf("%d\n",ans);
}
return 0;
}