[编程题]Median
- 热度指数：3132 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
- 算法知识视频讲解
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.
示例1
输入
4 11 12 13 14 5 9 10 15 16 17
输出
13
题意就是找两个升序数组合并后的中位数， 思路：假设a和b数组的大小分别是n1和n2，不进行排序，因为a和b数组本身就是排好序的，直接从小到大读a数组和b数组的元素，第(n1+n2)/2（向上取整）个元素即为所求。 #include<stdio.h>
int main()
{
in
展开全文
#include <bits/stdc++.h>
using namespace std;
//0 1 2 3
int main() {
int n;
vector<int>v;
while(cin>>n){
while(
展开全文
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> v;
int n, x;
展开全文
-
扫描二维码，关注牛客网
- 意见反馈
-
下载牛客APP，随时随地刷题
扫一扫，把题目装进口袋
- 求职之前，先上牛客
-
扫描二维码，进入QQ群
扫描二维码，关注牛客公众号
- 公司地址：北京市朝阳区北苑路北美国际商务中心K2座一层-北京牛客科技有限公司
- 联系方式：010-60728802 投诉举报电话：010-57596212（朝阳人力社保局）
- 牛客科技© All rights reserved admin@nowcoder.com
- 京ICP备14055008号-4 增值电信业务经营许可证 营业执照 人力资源服务许可证
-
京公网安备
11010502036488号
