HDOJ 1157 Who's in the Middle
来源:互联网 发布:蚂蚁分类信息5.8 源码 编辑:程序博客网 时间:2024/04/30 08:47
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.
一道求中位数的简单题
#include <stdio.h>#include <stdlib.h>#include <string.h>#include<iostream>#include<algorithm>using namespace std;bool cmp(int a,int b){ return a>b;}//从大到小排序;int main(){ int n; while(scanf("%d",&n)==1){ int i,j,arr[10005]; for(i=0;i<n;i++){ scanf("%d",&arr[i]); } sort(arr,arr+n,cmp); printf("%d\n",arr[(n-1)/2]); } return 0;}
下面用快排做:
/**#include <stdio.h>#include <stdlib.h>#include <string.h>#include<iostream>#include<algorithm>using namespace std;bool cmp(int a,int b){ return a>b;}//从大到小排序;int main(){ int n; while(scanf("%d",&n)==1){ int i,j,arr[10005]; for(i=0;i<n;i++){ scanf("%d",&arr[i]); } sort(arr,arr+n,cmp); printf("%d\n",arr[(n-1)/2]); } return 0;}**/#include <stdio.h>#include <stdlib.h>#include <string.h>#include<iostream>#include<algorithm>using namespace std;int cmp(const void *x,const void *y){ return (*(int *)x-*(int *)y);//从小到大 /** return (*(int *)y-*(int *)x);//从大到小**/}int main(){ int n; while(scanf("%d",&n)==1){ int i,j,arr[10005]; for(i=0;i<n;i++){ scanf("%d",&arr[i]); } qsort(arr,n,sizeof(int),cmp); /** for(int i=0;i<n;i++){ printf("%d\n",arr[i]); }**/ printf("%d\n",arr[(n-1)/2]); } return 0;}
- hdoj 1157 Who's in the Middle
- HDOJ 1157 Who's in the Middle
- [HDOJ 1157] Who's in the Middle (基础题)
- hdoj.1157 Who's in the Middle 20140811
- HDOJ 1157 Who's in the Middle(水)
- hdoj 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
- 64位系统vs2013配置opencv3.0
- 【玩转GridView】之Gridview对应行数值自动汇总
- iOS学习——FMDB详解
- Caffe学习记录:Cifar-10 自定义网络训练记录
- 安卓读取assets中的xml文件
- HDOJ 1157 Who's in the Middle
- CC学习笔记3:FIA类:标识和鉴别
- Tomcat重启负载高问题定位
- highcharts设置Y轴范围
- 关于我的第一篇博客
- openssl 非对称加密DSA,RSA区别与使用介绍
- 科协招新题目C:金字塔上的蜗牛
- Python学习之路二---(基础知识)
- jQuery 学习笔记(1)