HDU 1157 Who's in the Middle(排序取中间值)
来源:互联网 发布:js 检测分辨率 编辑:程序博客网 时间:2024/06/06 09:22
Who’s in the Middle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14554 Accepted Submission(s): 6530
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.
Source
USACO 2004 November
AC代码:
#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<string>#include<cstdlib>#include<algorithm>using namespace std;int main(){ int n,a[100010]; while(cin>>n){ for(int i=0;i<n;i++) cin>>a[i]; sort(a,a+n); cout<<a[n/2]<<endl; } return 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
- IOS中,Button的currentTitle和titleLabel.text的使用
- hadoop 学习笔记:mapreduce框架详解
- 正式赛-ZZULIOJ-1881-蛤玮的机房(并查集)
- 严重: StandardServer.await: create[localhost:8005]
- bzoj 3329: Xorequ 数位dp
- HDU 1157 Who's in the Middle(排序取中间值)
- 使用assembly将maven项目pom.xml中的jar包打包
- Android Hal层简要分析
- CommonJS、AMD和CMD规范
- poj2377 最大生成树 Kruskal
- HTML5第8次课堂笔记( 模拟form表单提交数据,xml的解析,jQuery的Ajax方法使用, mui的ajax)
- Java加密技术(一)——BASE64与单向加密算法MD5&SHA&MAC
- Jenkins入门系列
- sql server触发器