poj 2388 Who's in the Middle
2016-03-25 20:27
411 查看
Who's in the Middle
Description
FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as much or less.
Given an odd number of cows N (1 <= N < 10,000) and their milk output (1..1,000,000), find the median amount of milk given such that at least half the cows give the same amount of milk or more and at least half give the same or less.
Input
* Line 1: A single integer N
* Lines 2..N+1: Each line contains a single integer that is the milk output of one cow.
Output
* Line 1: A single integer that is the median milk output.
Sample Input
Sample Output
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 31149 | Accepted: 18073 |
FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as much or less.
Given an odd number of cows N (1 <= N < 10,000) and their milk output (1..1,000,000), find the median amount of milk given such that at least half the cows give the same amount of milk or more and at least half give the same or less.
Input
* Line 1: A single integer N
* Lines 2..N+1: Each line contains a single integer that is the milk output of one cow.
Output
* Line 1: A single integer that is the median milk output.
Sample Input
5 2 4 1 3 5
Sample Output
3
#include<stdio.h> #include<algorithm> using namespace std; int cmp(int x,int y) { if(x<y) return 1; else return 0; } int main () { int n,t,i,j; int a[1000005]; while (~scanf("%d",&n)) { for(i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n,cmp); if(n%2==0) t=(n/2)-1; else t=n/2; printf("%d\n",a[t]); } return 0; }
相关文章推荐
- perl 解json数组
- 纯虚函数与抽象类
- UAF漏洞学习
- TDR测试原理
- perl 解json数组
- perl 解json数组
- uva 10534——Wavio Sequence
- POJ 3253 (优先队列)
- JQ控制表格隔行换色和悬停换色
- C#Winform内存加载多条件查询数据
- PHP数组排序详解
- javaweb 中的乱码问题
- poj3356(LCS)
- 【BZOJ 3503】 [Cqoi2014]和谐矩阵|高斯消元|xor方程组
- Android神奇跑马灯效果多种实现
- 二叉树 题解
- leetcode——217——Contains Duplicate
- Find the smallest positive number missing from an unsorted array
- 简单的Android Studio 翻译插件
- struts2在idea中加入json的jar包后,引用无法解析的解决方法