URAL 1306-Sequence Median(堆)
2014-10-19 17:51
316 查看
1306. Sequence Median
Time limit: 1.0 secondMemory limit: 1 MB
Language limit: C, C++, Pascal
Given a sequence of N nonnegative integers. Let's define the median of such sequence. If N is odd the median is the element with stands in the middle of the sequence after it is sorted.
One may notice that in this case the median has position (N+1)/2 in sorted sequence if sequence elements are numbered starting with 1. If N is even then the median is the semi-sum of the two "middle" elements of sorted sequence. I.e. semi-sum
of the elements in positions N/2 and (N/2)+1 of sorted sequence. But original sequence might be unsorted.
Your task is to write program to find the median of given sequence.
Input
The first line of input contains the only integer number N — the length of the sequence. Sequence itself follows in subsequent lines, one number in a line. The length of the sequence lies inthe range from 1 to 250000. Each element of the sequence is a positive integer not greater than 231−1 inclusive.
Output
You should print the value of the median with exactly one digit after decimal point.Sample
input | output |
---|---|
4 3 6 4 5 | 4.5 |
#include <iostream> #include <algorithm> #include <cstdio> #include <cstring> #include <vector> #include <queue> using namespace std; const int maxn=250000; int a[maxn/2+10]; int main() { int n;double ans; while(scanf("%d",&n)!=EOF) { int num=0,x; for(int i=0;i<n/2+1;i++) scanf("%d",&a[i]); make_heap(a,a+n/2+1); for(int i=n/2+1;i<n;i++) { scanf("%d",&x); if(x<a[0]) { pop_heap(a,a+n/2+1); a[n/2]=x; push_heap(a,a+n/2+1); } } if(n%2) { ans=(double)a[0]; printf("%.1lf\n",ans); } else { ans=(double)a[0]; pop_heap(a,a+n/2+1); ans+=(double)a[0]; printf("%.1lf\n",ans/2.0); } } return 0; }
相关文章推荐
- Ural 1306 Sequence Median
- ural 1306. Sequence Median
- Ural 1306. Sequence Median
- ural 1306. Sequence Median
- ural 1306. Sequence Median(优先级队列 priority_queue用法)
- Ural_1306. Sequence Median(堆)
- Ural 1306. Sequence Median
- URAL 1306. Sequence Median(优先队列)
- ural 1306. Sequence Median
- URAL 1306. Sequence Median
- ural 1306. Sequence Median(优先级队列 priority_queue用法)
- ural 1306. Sequence Median(优先队列)
- ural 1306 Sequence Median
- ural 1306(堆-优先级序列)
- ural 1306 堆排序找中位数
- ural 1306 (heap推排序)
- ural 鹰蛋&51nod 1306
- URAL 1306 - Sequence Median 小内存求中位数
- ural 1306【priority_queue+堆查找中间值】
- 【解题报告】 URAL 1333 Genie Bomber 2 -- 利用类似统计的方法计算覆盖效率