hdu-oj 1157 Who's in the Middle
来源:互联网 发布:linux 查看hba 编辑:程序博客网 时间:2024/05/21 08:52
Who's in the Middle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9312 Accepted Submission(s): 4479
Problem 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.
Sample Input
524135
Sample Output
3HintINPUT DETAILS: Five cows with milk outputs of 1..5 OUTPUT DETAILS: 1 and 2 are below 3; 4 and 5 are above 3.
附代码:
#include <stdio.h>#include <algorithm>#include <string.h>int a[100010];using namespace std;int main(){ int n,i; while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a)); for(i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); printf("%d\n",a[n/2]); } return 0;}
0 0
- hdu-oj 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- hdu 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- hdu 1157 Who's in the Middle
- hdu 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- hdu 1157 Who's in the Middle
- hdu-1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- HDU 1157 Who's in the Middle
- HDU-1157-Who's in the Middle
- 在oracle的聚合函数(sum、avg等)中使用group by来分组你的结果
- Runtime(二)
- LeetCode——Distinct Subsequences
- c++ const 指针 简单解释
- HDOJ 题目1085 Holding Bin-Laden Captive!(母函数)
- hdu-oj 1157 Who's in the Middle
- 第一个项目(第5600小时加入)
- 洁面皂
- 仿淘点点 demo
- db数据库利用第三方框架进行提取和解析数据
- dubbo小教程
- 狗狗40题~ (Volume B)
- 关于Windows内存结构
- Spring源码由浅入深系列二 类结构