A1029. Median
来源:互联网 发布:unity3d窗口最大化 编辑:程序博客网 时间:2024/06/15 03:09
Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17} is 15. The median of two sequences is defined to be the median of the nondecreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.
Given two increasing sequences of integers, you are asked to find their median.
Input
Each input file contains one test case. Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (<=1000000) is the size of that sequence. Then N integers follow, separated by a space. It is guaranteed that all the integers are in the range of long int.
Output
For each test case you should output the median of the two given sequences in a line.
Sample Input
4 11 12 13 14
5 9 10 15 16 17
Sample Output
13
代码:
#include <cstdio>const int maxn = 1000010;const int INF = 0x7fffffff; // int数据上限int main() { int n, m; int s1[maxn], s2[maxn]; scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &s1[i]); } scanf("%d", &m); for (int i = 0; i < m; i++) { scanf("%d", &s2[i]); } s1[n] = s2[m] = INF; // 两个序列的最后一个元素设为int上限 int medianPos = (n + m - 1) / 2; int i = 0, j = 0, count = 0; while (count < medianPos) { if (s1[i] < s2[j]) { i++; } else { j++; } count++; } if (s1[i] < s2[j]) { printf("%d\n", s1[i]); } else { printf("%d\n", s2[j]); } return 0;}
- A1029. Median
- A1029. Median (25)
- PAT-A1029. Median (25)
- A1029. Median (25)
- PAT A1029. Median (25)
- PAT A1029
- PAT-A1029
- PAT a1029题解
- 刷清橙OJ--A1029.补充函数
- Median
- Median
- Median
- median
- Median
- Median
- Median
- median
- median
- Ubuntu下搭建VPN服务器的方法
- ACM复习(9)8611 大牛之路I
- js中replace小记
- JAVA的包装类
- Orace中大数据量的DML操作事务的优化
- A1029. Median
- 【常用函数封装】php-其他
- 【转】使用matlab软件打开一幅图片并且分别提取其中的RGB分量并显示
- 第二次大总结,开始做网页。。。
- 条件变量
- centos 安装 Jenkins 及简单轮询发布
- JVM基础之类加载器
- HDU 6058 链表
- caffe_install