Codeforces Round ＃219 （Div. 2） Counting Kangaroos is Fun

最新推荐文章于 2022-11-22 23:15:14 发布

bingsanchun

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量1w

点赞数

分类专栏： Binary Search

本文链接：https://blog.csdn.net/bingsanchun1/article/details/17315923

版权

Binary Search 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

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 test(s)

Input

825769842

Output

Input

891626583

Output

题意说是有n个袋鼠，口袋A<=2*口袋B，那么这个小袋鼠能被大的袋鼠装下，现在让尽量多的袋鼠被装下，求这个状态的最小值；

思路是折半搜索；

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
#define N 500009
using namespace std;
int a[N];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int w=n;
        for(int i=0; i<n; i++)
            scanf("%d",&a[i]);
            sort(a,a+n);
            int p=n-1;
            for(int i=n/2-1;i>=0;i--)
            {
                if(a[i]*2<=a[p])
                {
                    p--;
                }
            }
            printf("%d\n",p+1);
    }
    return 0;
}