Who's in the Middle(poj 2388)
来源:互联网 发布:python 生成6位随机数 编辑:程序博客网 时间:2024/05/17 07:36
Who's in the Middle
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30780 Accepted: 17864
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
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.
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
水题一枚~专项练习数据结构排序里面的。发上来只想说语言的魅力是无穷的 。
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <algorithm>using namespace std;int cmp(int a,int b){ return a>b;}int main(){ int n,i; int str[10010]; while (~scanf("%d",&n)) { for(i=0;i<n;i++) scanf("%d",&str[i]); sort(str,str+n,cmp); printf("%d\n",str[(n-1)/2]); } return 0;}
0 0
- POJ--2388 Who's in the Middle
- poj 2388 Who's in the Middle
- POJ-2388 who's in the middle
- poj-2388 Who's in the Middle
- poj 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- poj 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- Poj 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- poj 2388 Who's in the Middle
- POJ-2388-Who's in the Middle
- poj 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- poj 2388 Who's in the Middle
- Who's in the Middle(poj 2388)
- POJ 2388:Who's in the Middle
- Android permission 访问权限
- day86(硅谷)
- ubuntu13.10源码安装php5.5
- 我的第一个程序是在Windows7 上完成的
- 函数指针的用法
- Who's in the Middle(poj 2388)
- [LeetCode] Longest Palindromic Substring [14]
- Thread的start和run
- redis 安全
- leetcode——Reverse Integer 反转整数数字(AC)
- 《硬啃设计模式》 第26章 万能排序 - 模板方法模式(Template Method Pattern)
- github 分支管理
- 关于问题:无法解析类型java.lang.Object
- Java中为面板(JPanel)添加标题