Who's in the Middle poj2388 vector 水题
来源:互联网 发布:电脑编程语言 编辑:程序博客网 时间:2024/06/11 17:33
Who's in the Middle
Time Limit: 1000MS
Memory Limit: 65536KTotal Submissions: 33021
Accepted: 19238
Memory Limit: 65536KTotal Submissions: 33021
Accepted: 19238
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.
题意就是让我们找到一组数中找到一个数,使得比它大的数的个数与比它小的数的个数相等,思路还是比较好想的,首先排个序,然后直接输出中间那个数就行了,这里本来可以用数组,但我最近在学STL,就用了<vector>,其实用<set>更简单,因为前者在数据插入完成后是无序的,而后者是有序的,但也无妨,因为可以用sort()对<vector>进行快速排序。
#include<iostream>#include<algorithm>#include<vector>using namespace std;int main(){vector<int> milk;vector<int>::iterator it;int n,temp;cin>>n;for(int i=0;i<n;i++){cin>>temp;milk.push_back(temp);}sort(milk.begin(),milk.end());cout<<milk[n/2]<<endl;return 0;}
0 0
- Who's in the Middle poj2388 vector 水题
- Who's in the Middle POJ2388
- poj2388 Who's in the Middle
- POJ2388-Who's in the Middle
- POJ2388-Who's in the Middle
- POJ2388 Who's in the Middle 快排
- POJ2388《Who's in the Middle》方法:排序
- poj2388——Who's in the Middle
- poj2388 Who's in the Middle 快排
- POJ2388——Who's in the Middle
- POJ2388 HDU1157 Who's in the Middle【中位数+排序】
- Who's in the Middle(poj2388 排序)
- poj2388——Who's in the Middle
- 快速排序浅谈——(解题报告)HDU1157和POJ2388---Who's in the Middle
- [2388]Who's in the Middle(水题)
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- 关于线程编程(About Threaded Programming)
- LINUX安装图形管理界面
- 链表操作
- 关于Silverlight的跨域访问问题
- C++回顾之拷贝构造函数
- Who's in the Middle poj2388 vector 水题
- .NET 的 WCF 和 WebService 有什么区别?
- C++回顾之类数据成员的初始化
- 2014年流行的计算机语言分析
- C++回顾之构造函数与析造函数
- C++回顾之前向声明、嵌套类、局部类
- 1.31张佳莉
- C++回顾之成员函数重载、类与结构体、this指针
- C++回顾之内联函数及新类型转换运算符