acm_problem_1016
来源:互联网 发布:控制网络与现场总线 编辑:程序博客网 时间:2024/06/07 13:45
题目描述:
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 <br> <br>* 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
代码:
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N,i,b,s[10001];
while(cin>>N)
{
if(N%2==1)
{
for(i=1;i<=N;i++)
{
cin>>s[i];
}
sort(s,s+N+1);
b=(N+1)/2;
cout<<s[b]<<endl;
}
}
}
感想:一个sort排序就可以了。。
0 0
- acm_problem_1016
- 在deepin上跑BOINC的一点经验总结
- Android Volley完全解析
- Atitit.css 规范 bem 项目中 CSS 的组织和管理
- 蓝桥杯 错误票据
- mysql数据库的使用与理解( 基于ubuntu 14.0.4 LTS 64位)
- acm_problem_1016
- ZK部署
- Java实现快速排序
- 面向对象设计原则
- 基于tensorflow的MNIST手写数字识别(二)--入门篇
- Atitit.获得向上向下左的右的邻居的方法 软键盘的设计..
- Java读写txt或doc文件
- 理解C语言中指针的声明以及复杂声明的语法
- Android Volley的请求封装,实现图片内存缓存(防止OOM),数据磁盘缓存,及清除磁盘缓存