PAT甲 1029. Median (25)

最新推荐文章于 2022-04-06 15:50:57 发布

Jelly_acm

最新推荐文章于 2022-04-06 15:50:57 发布

阅读量240

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/Jelly_acm/article/details/52491200

PAT 专栏收录该内容

39 篇文章

订阅专栏

本文介绍了一种算法，该算法接收两个递增整数序列作为输入，并输出这两个序列合并后的中位数。通过先合并两个序列再进行排序的方法找到中位数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1029. Median (25)

时间限制

1000 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

整体排序即可

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
long int a[2000005];

int main()
{
  long int k1, k2, i, j;
  while (~scanf("%ld",&k1))
  {
    for (i = 0; i < k1; i++)
      scanf("%ld",&a[i]);
    scanf("%ld", &k2);
    for (i = k1; i < k1 + k2; i++)
      scanf("%ld", &a[i]);
    sort(a, a + k1 + k2);
    j = (k1 + k2 -1) / 2;
    printf("%ld\n", a[j]);
  }
  return 0;
}