POJ2388——Who's in the Middle
来源:互联网 发布:战地4枪械数据 编辑:程序博客网 时间:2024/05/16 02:10
POJ2388——Who's in the Middle
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.
#include "stdafx.h"//快速排序求中位数#include<iostream>using namespace std;void quickSort(int a[], int l, int r){if (l < r){int i = l, j = r, x = a[(l + r) / 2];while (i < j){while (i < j&&a[j] > x)j--;if (i < j)a[i++] = a[j];while (i < j&&a[i] < x)i++;if (i < j)a[j--] = a[i];}a[i] = x;quickSort(a, i + 1, r);quickSort(a, l, i - 1);}}int main(){int cow_number;cin >> cow_number;int *cow = new int[cow_number];for (int *i = cow; i < cow + cow_number; i++)cin >> *i;quickSort(cow, 0, cow_number - 1);cout << cow[cow_number / 2] << endl;}
0 0
- poj2388——Who's in the Middle
- POJ2388——Who's in the Middle
- poj2388——Who's in the Middle
- Who's in the Middle POJ2388
- poj2388 Who's in the Middle
- POJ2388-Who's in the Middle
- POJ2388-Who's in the Middle
- 快速排序浅谈——(解题报告)HDU1157和POJ2388---Who's in the Middle
- POJ2388 Who's in the Middle 快排
- POJ2388《Who's in the Middle》方法:排序
- Who's in the Middle poj2388 vector 水题
- poj2388 Who's in the Middle 快排
- POJ2388 HDU1157 Who's in the Middle【中位数+排序】
- Who's in the Middle(poj2388 排序)
- HDU—— 1157 Who's in the Middle
- HDU --1157 Who's in the Middle——nth_element
- Who's in the Middle
- Who's in the Middle
- css3中的flex布局
- return 2
- swust oj代码+解析_1165,0284,0074,0042,1171,0026,0189,0078,0046,0077,0209,0129
- python网络请求和"HTTP Error 504:Fiddler - Receive Failure"
- php大文件上传php.ini配置
- POJ2388——Who's in the Middle
- 压缩本地图片并上传至服务器
- 设计模式总结
- 单点登录cas常见问题系列汇总 - 持续更新
- strcpy strcpy_s strncpy strlcpy区别与联系
- oracle表空间使用率查询
- 形式参数是类名的问题
- 技术系列3——泛型的来源与优势
- Linux下串口通信详解(下)读写串口及关闭串口