hdu 1157 Who's in the Middle
来源:互联网 发布:linux 安卓 知乎 编辑:程序博客网 时间:2024/06/09 20:55
import java.util.Scanner;public class p1157 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);while (sc.hasNext()) {int n = sc.nextInt();if(n==0){return;}int[] a = new int[n];for (int i = 0; i < a.length; i++) {a[i] = sc.nextInt();}mySort(a);System.out.println(a[a.length / 2]);}}public static void mySort(int[] a) {// 快排for (int i = 0; i < a.length - 1; i++) {int temp = i;for (int j = i + 1; j < a.length; j++) {if (a[temp] > a[j]) {temp = j;// 记下最小的数}}if (temp != i) {a[temp] = a[temp] ^ a[i];a[i] = a[temp] ^ a[i];a[temp] = a[temp] ^ a[i];}}}}
题意:
首先:是无限输入,当输入零时结束(通过观看c代码总结出,非题意所给)
目标:求出输入母羊数的中间数(N是奇数)
方法:对输入的数据进行*快排*(其他的排序也行,但是不要超时)
Who's in the Middle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11096 Accepted Submission(s): 5248
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.
Source
USACO 2004 November
0 0
- 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
- HDU 1157 Who's in the Middle
- 【机器学习】分布式云端机器学习
- jQuery获取文本节点之 text()/val()/html() 方法区别
- Searching: Balanced Tree Search And Insertion
- WSAGetLastError 的详细解析
- 把时间当作朋友 读书笔记
- hdu 1157 Who's in the Middle
- 【操作系统总结】经典的进程同步问题-生产者消费者问题
- 在Mac上Git的使用(一)
- 爬虫笔记
- 黑马程序员——运算符
- 第十三周项目一(二)
- maven学习-02
- mark-java 正则表达式
- jquey easyui 常用方法