杭电 OJ 1157
2017-07-28 18:17
162 查看
Who's in the Middle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19136 Accepted Submission(s): 8425
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.
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
Hint
INPUT DETAILS:
Five cows with milk outputs of 1..5
OUTPUT DETAILS:
1 and 2 are below 3; 4 and 5 are above 3.
只要简单的输出中间数就行了
#include<iostream> #include<algorithm> using namespace std; int main() { int a[10010]; int m; int i; //while(scanf("%d",&m)!=EOF) {
while(cin>>m&&m) { for(i=0;i<m;i++) cin>>a[i]; sort(a,a+m); cout<<a[(m-1)/2]<<endl; } return 0; }
相关文章推荐
- 杭电oj1157 排序 参考1040
- 杭电OJ——1157 Who's in the Middle(水题)
- 杭电oj-2544-最短路
- 杭电oj-acm steps-1.2
- 杭电OJ题目分类
- 【杭电oj1702】ACboy needs your help again!
- 【杭电OJ】的input,output(一)
- 【杭电oj2012】素数判定
- 杭电oj 1008
- 【杭电oj1179】Ollivanders: Makers of Fine Wands since 382 BC.
- 【杭电oj5253】连接的管道
- 【杭电oj】5053-the Sum of Cube(立方和)
- 杭电OJ——1198 Farm Irrigation (搜索)
- 杭电oj-1115-Lifting the Stone
- 杭电oj-1083 C - Courses --mystical_curve
- 杭电oj-1018
- Java解题-杭电OJ-1001题
- 杭电OJ题 1391 Number Steps 解题报告
- 杭电OJ——1124 Factorial(水题)
- 2017-12-09 杭电OJ2000 《ASCII码排序》