杭电1157(sort函数)
2015-06-17 16:15
274 查看
头文件是#include<algorithm> 比如说数组a[5]={1,5,4,2,3}; 当你用sort(a,a+5)时,就把数组a从小到大排序了 for(i=0;i<5;i++) { printf("%d \n",a[i]); } 输出为1 2 3 4 5
Who's in the Middle
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.
* Line 1: A single integer N * Lines 2..N+1: Each line contains a single integer that is the milk output of one cow
* Line 1: A single integer that is the median milk output.
5
2
4
1
3
5
3
#include <stdio.h> #include <algorithm> #include <iostream> using namespace std; int main() { int n, i; int arr[10005]; while(scanf("%d", &n)!=EOF) { for(i=0; i<n; i++) scanf("%d", &arr[i]); sort(arr, arr+n); printf("%d\n", arr[n/2]); } return 0; }
相关文章推荐
- VS2008远程调试
- 粒子群算法(PSO)
- CBIR 基于Hash图像检索小结(待完成计划)
- 《学习OpenCV》第三章课后题5
- android Sqlite 模板 。
- handler中的handler.removecallbacks和handler.removemessages的用法
- C# 获取两个矩形相减部分的GraphicsPath
- sobel边缘检测算子
- php网站优化-(ab测试)
- 算法 线性排序-计数排序
- Scripts:ash_gcwait_to_obj.sql
- 合理规划SAT阅读备考节奏
- 深入理解linux内核读书笔记(第三章)
- usb fx2 cy68013 Cyapi使用心得
- iOS app调试的黑魔法--第三方库
- 【整理】MySQL引擎
- jQuery开发之超链接提示效果和图片提示效果
- HDU 1800 Flying to the Mars 字符串哈希||字典树||map
- Hadoop2.6 Ha 安装
- 十六进制转化为十进制的方法