M - Counting Kangaroos is Fun . Codeforces 373C

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·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
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. 代码如下：

#include<cstdio>
#include<algorithm>
using namespace std;//给sort命名空间

const int MAXN=1e6+10;
int a[MAXN];
int main()
{
    int n,i,cnt,head;
    scanf("%d",&n);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);//将袋鼠从小到大排序 
    head=n/2+1;     //将袋鼠从中间划分成两组 
    cnt=0;          //记录装到袋子里的袋鼠 
    for(i=1;i<=n/2;++i)   //判断最多有多少小袋鼠能装进大袋鼠里面 
    {
        int pos=lower_bound(a+head,a+n+1,2*a[i])-a;//指针相减才有意义 记录查能装下小袋鼠的最小位置 
        if(pos>=n+1) break; //如果查找失败 跳出 
        head=pos+1;//查找区间向右移动 
        ++cnt;     
    }
    printf("%d\n",n-cnt);
    return 0;
 }