题目1004:Median
来源:互联网 发布:大数据 技术体系 编辑:程序博客网 时间:2024/05/18 00:36
- 题目描述:
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 non-decreasing 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.
- 输入:
Each input file may contain more than 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.
- 输出:
For each test case you should output the median of the two given sequences in a line.
- 样例输入:
4 11 12 13 145 9 10 15 16 17
- 样例输出:
13
#include<stdio.h>
#include<algorithm>
using namespace std;
int arr[2000000];
int main(){
int numberA = 0, numberB = 0;
while (scanf("%d", &numberA) != EOF){
int indexArr = 0;
for (int i = 0; i < numberA; i++){
scanf("%d", &arr[indexArr++]);
}
scanf("%d", &numberB);
for (int i = 0; i < numberB; i++){
scanf("%d", &arr[indexArr++]);
}
int length = numberA + numberB;
sort(arr, arr + length);
printf("%d\n", arr[(length-1) / 2]);
}
return 0;
}
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 题目1004:Median
- 【九度】题目1004:Median
- 九度 题目1004:Median
- 九度题目1004:Median
- 题目1004:Median(数组Merge)
- 简单算法练习-题目1004:Median
- 九度——题目1004:Median
- STL中的list容器的一点总结
- gvim 字体设置无效解决办法
- Linux系统搭建SVN教程
- windows7操作系统
- 链表基本操作
- 题目1004:Median
- 百度首页的测试用例设计
- windows上安装深度学习框架——Keras
- 算法面试字符串-题目2-删除和复制
- Ajax技术--服务器返回数据格式(HTML,XML,JSON)
- 换个眼界,换种心情
- Java基础方面:
- 挑战ACM迷宫
- Android——BitMap图片压缩