POJ 2388
来源:互联网 发布:html中调用javascript 编辑:程序博客网 时间:2024/06/03 07:09
Who's in the Middle
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22127 Accepted: 12641
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.
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.
* 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.
又是洪水题。。。
#include<stdio.h>#include<string>#include<iostream>#include<algorithm>using namespace std;int a[100000] = {0},n,i;int main(){ scanf("%d",&n); for(i = 0;i < n;i++) scanf("%d",&a[i]); sort(a,a+n); printf("%d\n",a[(n-1) / 2]); return 0;}
- poj 2388
- POJ 2388
- POJ-2388
- poj 2388
- poj.2388
- poj-2388
- poj 2388
- poj 2388
- POJ 2388
- POJ 2388
- poj 2388
- POJ 2388 水题
- POJ 2388(中位数)
- POJ 2388(nth_element)
- poj 2388中位数
- POJ 2388 解题报告
- POJ 2388(快速排序)
- poj 2388 insert sorting
- JAVA反射机制
- BackTrack5 R2 GNOME 汉化
- poj3480
- android Settings项目安装 (模拟器版)
- hadoop常见错误及处理方法
- POJ 2388
- 关于Cmake
- Address already in use: JVM_Bind<null>:8080
- c#调用vb.net的项目
- 属性“waitingInvoiceAmount”是对象的一部分,不能被修改
- 远程访问xampp access forbidden
- 如何反编绎APK文件
- ( 转载)栈区,堆区,全局区,文字常量区,程序代码区 详解
- KUL3.0版学习手册