Counting Kangaroos is Fun
来源:互联网 发布:168源码 编辑:程序博客网 时间:2024/04/29 01:44
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
825769842
5
891626583
5
<pre name="code" class="cpp">#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<queue>#include<stack>#include<iostream>#include<algorithm>using namespace std; int a[1000100];int main(){ int i,n,h; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); int ans=n; h=n-1; for(i=n/2-1;i>=0;i--) { if(a[i]*2<=a[h]) { ans--; h--; } } printf("%d\n",ans); } return 0;}//这题仿佛在逗我-.- //最开始写的。。。想着咋能每个人只对战一次都想疯了。。。然而最后决定不用二分-.- 直接模拟 /*#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<queue>#include<stack>#include<iostream>#include<algorithm>using namespace std; int main(){int a[100001];a[0] = 0;int n;while(scanf("%d",&n),n){for(int i = 1; i <= n; i++){scanf("%d",&a[i]);}sort(a+1,a+n+1);int flag = n;int l = 0,r = n;int ccc = 100;while(ccc--){int mid = (l+r)/2;if(2*a[mid] <= a[n]){if(n-mid < flag){flag = n-mid;}l = mid;}else{r = mid;}}printf("%d\n",flag);}} */
- Counting Kangaroos is Fun
- A. Counting Kangaroos is Fun
- CodeForces 372 A. Counting Kangaroos is Fun
- cf 372A Counting Kangaroos is Fun
- codeforces327A Counting Kangaroos is Fun【二分】
- 【CodeForces】[372A]Counting Kangaroos is Fun
- CodeForces 372 A Counting Kangaroos is Fun
- CodeForces 372A Counting Kangaroos is Fun
- Codeforces-Counting Kangaroos is Fun【贪心】【二分】
- codeforces #373 C.Counting Kangaroos is Fun
- A. Counting Kangaroos is Fun----暴力
- Codeforces Round #219 (Div. 2) Counting Kangaroos is Fun
- Codeforces Round #219 (Div. 1) A. Counting Kangaroos is Fun
- Codeforces #219 (Div. 2) C. Counting Kangaroos is Fun
- CodeForces 372A Counting Kangaroos is Fun 动物PK
- Codeforces Round #219 (Div. 2)--C. Counting Kangaroos is Fun
- Codeforces-372A Counting Kangaroos is Fun(贪心)
- 【CodeForces】373C - Counting Kangaroos is Fun(二分)
- mysql如何消除表空间碎片
- 随堂笔记第一天:环境变量配置,代码的三种注释方法,第一个程序,基本数据类型------1
- 7.COM 自动化原理
- 在 Laravel 5 中使用 Laravel Excel 实现 Excel/CSV 文件导入导出功能
- 浅拷贝&深拷贝|| MutableCopy& Copy
- Counting Kangaroos is Fun
- Hibernate:Disjunction&Conjunction构造复杂的查询条件
- 22.css定义width和height的大小
- 二分查找
- 2016多校第三场 HDU 5755
- Android Studio 提交现有项目到osc
- FZU2039 匈牙利算法
- HDFS 单机搭建
- POJ-2507 Crossed ladders