HDOJ1157Who's in the Middle
来源:互联网 发布:夜神模拟器清理数据 编辑:程序博客网 时间:2024/06/05 23:46
Who's in the Middle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20228 Accepted Submission(s): 8883
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.
求中位数
import java.util.Arrays;import java.util.Scanner;//求中位数public class Main{private static Scanner scanner;public static void main(String[] args) {scanner = new Scanner(System.in);while (scanner.hasNext()) {int n = scanner.nextInt();int arr[] = new int[n];for (int i = 0; i < n; i++) {arr[i] = scanner.nextInt();}Arrays.sort(arr);int cen = 0;cen = arr[n / 2];System.out.println(cen);}}}
阅读全文
0 0
- HDOJ1157Who's in the Middle
- PKU_ACM_2388_Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- hdu1157Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- hdu1157Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- 疯狂Activiti6.0连载(22)流程存储Web Service
- 素数求解
- cookie
- 感知器和神经网络训练(公式推导及C++实现)
- Neo4j Causal Cluster 概要
- HDOJ1157Who's in the Middle
- 词向量和语言模型阅读笔记
- cell的重用原理
- SpringMVC中重定向数据转发
- 【题解】【uva11990】【bzoj3295】动态逆序对 ``Dynamic'' Inversion
- codeforce 399 div1 a
- 并发工具类(五) Phaser类
- dom4j使用XPath
- Fresco+RecyclerView+OkHttp+ButterKnife传值+条目点击跳转